On bounding the diameter of a distance-regular graph

DOI10.1007/s00493-021-4619-1OpenAlexW3217522410MaRDI QIDQ2151185

Arnol Neumaier, Safet Penjić

Publication date: 30 June 2022

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-021-4619-1

zbMATH Keywords

upper bounddistance-regular graphdiameter

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Delsarte set graphs with small \(c_{2}\)
• Distance-regular graphs with or at least half the valency
• The girth of a thin distance-regular graph
• On subgraphs in distance-regular graphs
• On the Terwilliger algebra of bipartite distance-regular graphs with \(\Delta_2 = 0\) and \(c_2 = 2\)
• A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Bounding the diameter of distance. Regular graphs
• A remark on partial linear spaces of girth 5 with an application to strongly regular graphs
• The diameter of bipartite distance-regular graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• The distance-regular graphs of valency four
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Determination of the distance-regular graphs without 3-claws
• Intersection numbers of bipartite distance-regular graphs
• A characterization of distance-regular graphs with diameter three
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Tight distance-regular graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• Geometric distance-regular graphs without 4-claws
• A bound for the diameter of distance-regular graphs
• Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• Geometric antipodal distance-regular graphs with a given smallest eigenvalue
• Distance-regular graphs without 4-claws
• Two new infinite families of arc-transitive antipodal distance-regular graphs of diameter three with \(\lambda =\mu \) related to groups \(\mathrm{Sz}(q)\) and \(^2G_2(q)\)
• Diameter bounds for geometric distance-regular graphs
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• Improving diameter bounds for distance-regular graphs
• A unified view of inequalities for distance-regular graphs. I
• Cubic Distance-Regular Graphs
• On the Maximum Diameter of a Class of Distance-Regular Graphs
• Algebraic Graph Theory

This page was built for publication: On bounding the diameter of a distance-regular graph