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

DOI10.1112/blms/13.4.316zbMath0457.05055OpenAlexW2093008850MaRDI QIDQ3905326

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

distance-regular graphscharacteristic polynomialMoore graphintersection arraygeneralised polygonmaximum diameter

Mathematics Subject Classification ID

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

Related Items (12)

A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ On symmetric Moore geometries ⋮ On the spectrum and linear programming bound for hypergraphs ⋮ On bounding the diameter of a distance-regular graph ⋮ The degree of the eigenvalues of generalized Moore geometries ⋮ Linear programming bounds for regular graphs ⋮ Remarks on distance-regular graphs ⋮ On generalized Moore geometries. I, II ⋮ A spectral version of the Moore problem for bipartite regular graphs ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue ⋮ A short proof of a theorem of Bannai and Ito ⋮ On the existence of certain generalized Moore geometries. I

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