Bounding the diameter of distance. Regular graphs

DOI10.1007/BF02189090zbMath0657.05047OpenAlexW2094707013WikidataQ56673209 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

eigenvaluedistance regular graphconnected graphsco-connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (16)

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 ⋮ On geodesic transitive graphs ⋮ 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\) ⋮ 2-walk-regular graphs with a small number of vertices compared to the valency ⋮ Partially metric association schemes with a multiplicity three ⋮ The local spectra of regular line graphs ⋮ Distance regular covers of the complete graph ⋮ On pseudo-distance-regularity ⋮ Two-distance-primitive graphs with prime valency ⋮ The geometry oft-spreads ink-walk-regular graphs ⋮ There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three ⋮ Perfect colorings of regular graphs ⋮ The Local Spectra of Line Graphs ⋮ Completely regular designs of strength one

Cites Work

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

This page was built for publication: Bounding the diameter of distance. Regular graphs