Results 241 to 250 of about 28,279 (264)

A Bound for the Diameter of Distance-Regular Graphs

Combinatorica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Distance-regular graphs

1978
Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in general k1 ⩽ k2. For distance-regular graphs of diameter at least four, k1=k2 if and only if the graph is simply a circuit.
D. E. Taylor, Richard Levingston
openaire   +1 more source

Distance-Regular Graphs

1989
Brouwer, A.E., Cohen, A.M., Neumaier, A.
openaire   +4 more sources

Thin Q-Polynomial Distance-Regular Graphs Have Bounded $$c_2$$

Graphs and Combinatorics, 2022
Ying-Ying Tan, Jack Koolen, Jongyook Park   +2 more
exaly  

On the Cheeger constant for distance-regular graphs

Journal of Combinatorial Theory - Series A, 2020
Zhi Qiao, Jack Koolen, Greg Markowsky
exaly  

Distance-regular graphs with a1 or c2 at least half the valency

Journal of Combinatorial Theory - Series A, 2012
Jack Koolen, Jongyook Park
exaly  

Observability in Connected Strongly Regular Graphs and Distance Regular Graphs

IEEE Transactions on Control of Network Systems, 2014
Alain Kibangou
exaly  

There are only finitely many distance-regular graphs of fixed valency greater than two

Advances in Mathematics, 2015
Jack Koolen
exaly  

The distance spectrum and energy of the compositions of regular graphs

Applied Mathematics Letters, 2009
Dragan Stevanovic
exaly  

A valency bound for distance-regular graphs

Journal of Combinatorial Theory - Series A, 2018
Zhi Qiao, Jack Koolen
exaly