Bounding the diameter of distance. Regular graphs

DOI10.1007/BF02189090zbMath0657.05047WikidataQ56673209 ScholiaQ56673209MaRDI QIDQ1110534

Chris D. Godsil

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02189090

zbMATH Keywords

eigenvalue; distance regular graph; connected graphs; co-connected graphs

Mathematics Subject Classification ID

05C38: Paths and cycles

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C99: Graph theory

Related Items

Perfect colorings of regular graphs, On pseudo-distance-regularity, On geodesic transitive graphs, 2-walk-regular graphs with a small number of vertices compared to the valency, The local spectra of regular line graphs, There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three, A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\), Distance regular covers of the complete graph, Completely regular designs of strength one, Partially metric association schemes with a multiplicity three, Two-distance-primitive graphs with prime valency, On bounding the diameter of a distance-regular graph, Geometric aspects of 2-walk-regular graphs, A note on distance-regular graphs with a small number of vertices compared to the valency, The geometry oft-spreads ink-walk-regular graphs, The Local Spectra of Line Graphs

Cites Work

• A new feasibility condition for distance-regular graphs
• Eigenvalue multiplicities of highly symmetric graphs
• Spherical codes and designs
• Eigenvectors of Distance-Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item