AbstractWe show that the bilinear forms graphsHq(n,d) of diameterd≥ 3 are characterized as distance-regular graphs by their parameters provided that eithern≥d+3 andq≥ 3, orn≥d+4 andq=2. As a corollary of the method used, we can show the following. If Γ is a distance-regular graph with classical parameters (d,q,α,β) and diameterd≥3, then either Γ is a Johnson graph, a Grassmann graph, a Hamming graph, or a bilinear forms graph, or β is bounded in terms ofd,qand α
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
AbstractWe classify the dual bipartite Q-polynomial distance-regular graphs of diameterd≥5which are ...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...
AbstractWe show that the bilinear forms graphsHq(n,d) of diameterd≥ 3 are characterized as distance-...
AbstractWilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restric...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractLetΓ=(X,R) denote a distance-regular graph with distance function ∂ and diameterd⩾4. By a pa...
If n ⩾ 2d ⩾ 6 and q ⩾ 4, the distance-regular graphs Hq (n, d) (with d × n matrices over GF(q) as ve...
A graph $\Gamma $ with diameter $d $ is said to be distance-regular if there are integers bi $(\math...
AbstractLet Φ, Φ′ be Leonard systems over a field K, and V, V′ the vector spaces underlying Φ, Φ′, r...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
AbstractWe classify the dual bipartite Q-polynomial distance-regular graphs of diameterd≥5which are ...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...
AbstractWe show that the bilinear forms graphsHq(n,d) of diameterd≥ 3 are characterized as distance-...
AbstractWilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restric...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractLetΓ=(X,R) denote a distance-regular graph with distance function ∂ and diameterd⩾4. By a pa...
If n ⩾ 2d ⩾ 6 and q ⩾ 4, the distance-regular graphs Hq (n, d) (with d × n matrices over GF(q) as ve...
A graph $\Gamma $ with diameter $d $ is said to be distance-regular if there are integers bi $(\math...
AbstractLet Φ, Φ′ be Leonard systems over a field K, and V, V′ the vector spaces underlying Φ, Φ′, r...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
AbstractWe classify the dual bipartite Q-polynomial distance-regular graphs of diameterd≥5which are ...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...