Benjian Lv

Benjian Lv
Are you Benjian Lv?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Benjian Lv
Affiliation
Location

Pubs By Year

Pub Categories

 
Mathematics - Combinatorics (13)

Publications Authored By Benjian Lv

The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Read More

Let $\mathbb{Z}_{p^s}$ be the residue class ring of integers modulo $p^s$, where $p$ is a prime number and $s$ is a positive integer. Using matrix representation and the inner rank of a matrix, we study the intersection, join, dimension formula and dual subspaces on vector subspaces of $\mathbb{Z}^n_{p^s}$. Based on these results, we investigate the Grassmann graph $G_{p^s}(n,m)$ over $\mathbb{Z}_{p^s}$. Read More

A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumption of the commutativity. Read More

In this paper, we classify commutative weakly distance-regular digraphs of valency 3 with girth more than 2 and one type of arcs. As a result, commutative weakly distance-regular digraphs of valency 3 are completely determined. Read More

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined. Read More

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6. Read More

Suzuki (2004) [7] classified thin weakly distance-regular digraphs and pro- posed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) [9] under the assumption of the commutativity. In this paper, we continue this project and classify these digraphs with girth more than 2 and two types of arcs. Read More

A graph is called a pseudo-core if every endomorphism is either an automorphism or a colouring. In this paper, we show that every Grassmann graph $J_q(n,m)$ is a pseudo-core. Moreover, the Grassmann graph $J_q(n,m)$ is a core whenever $m$ and $n-m+1$ are not relatively prime, and $J_q(2pk-2, pk-1)$ is a core whenever $p,k\geq 2$. Read More

In [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Math. Read More

In [The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635], Levstein and Maldonado computed the Terwilliger algebra of the Johnson scheme $J(n,m)$ when $3m\leq n$. The distance-$m$ graph of $J(2m+1,m)$ is the Odd graph $O_{m+1}$. In this paper, we determine the Terwilliger algebra of $O_{m+1}$ and give its basis. Read More

Levstein and Maldonado [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635] computed the Terwilliger algebra of the Johnson scheme $J(n,m)$ when $3m\leq n$. Read More

In this note, we prove some combinatorial identities and obtain a simple form of the eigenvalues of $q$-Kneser graphs. Read More