On the Maximum Diameter of a Class of Distance-Regular Graphs

DOI10.1112/BLMS/13.4.316MaRDI QIDQ3905326zbMATH OpenOpenAlexFDO

Authors Michael A. Georgiacodis, Robert Mark Damerell

Publication date 1981

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/13.4.316

zbMATH Keywords

characteristic polynomialdistance-regular graphsgeneralised polygonintersection arraymaximum diameterMoore graph

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Cited in

(12)

• The degree of the eigenvalues of generalized Moore geometries
• Remarks on distance-regular graphs
• On symmetric Moore geometries
• On the spectrum and linear programming bound for hypergraphs
• On bounding the diameter of a distance-regular graph
• A spectral version of the Moore problem for bipartite regular graphs
• Maximizing the order of a regular graph of given valency and second eigenvalue
• On generalized Moore geometries. I, II
• A Spectral Moore Bound for Bipartite Semiregular Graphs
• A short proof of a theorem of Bannai and Ito
• On the existence of certain generalized Moore geometries. I
• Linear programming bounds for regular graphs

This page was built for publication: On the Maximum Diameter of a Class of Distance-Regular Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3905326)