# Distance-regular graph

Known as: Intersection Array, Array, Distance-regular graphs
In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and… (More)
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
• Eur. J. Comb.
• 2010
A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest… (More)
Is this relevant?
2010
2010
• J. Comb. Theory, Ser. A
• 2010
Distance-regular graphs have been a key concept in Algebraic Combinatorics and have given place to several generalizations, such… (More)
• Is this relevant?
2009
2009
• Eur. J. Comb.
• 2009
The vertex-connectivity of a distance-regular graph equals its valency. © 2008 Dr Andries E. Brouwer. Published by Elsevier Ltd… (More)
Is this relevant?
2007
2007
We consider a distance-regular graph ? with diameter d 3 and eigenvalues k = 0 > 1 > > d. We show the intersection numbers a 1… (More)
Is this relevant?
2004
2004
Let C denote a bipartite distance-regular graph with diameter D 12. We show C is Q-polynomial if and only if one of the following… (More)
Is this relevant?
2003
2003
We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely… (More)
• • • Is this relevant?
1997
1997
Let Γ = (X, R) denote a distance-regular graph with diameter D ≥ 3 and distance function δ. A (vertex) subgraph ∆ ⊆ X is said to… (More)
Is this relevant?
1996
1996
• J. Comb. Theory, Ser. B
• 1996
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of… (More)
Is this relevant?
1996
1996
depend only on j 5 ­ G ( u , x ) rather than on individual vertices . It is easy to see that if G is a distance-regular graph… (More)
Is this relevant?
1977
1977
For each bipartition_of a bipartite distance-regular graph F, there naturally corresponds another distance-regular graph F called… (More)
Is this relevant?