There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k₂k and large diameter

DOI10.1016/J.JCTB.2013.09.005MaRDI QIDQ6983177zbMATH OpenFDO

Authors Jongyook Park, Jack H. Koolen, Greg Markowsky

Publication date 15 May 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2013.09.005

zbMATH Keywords

Bannai-Ito conjecturedistance-regular graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites work

• A distance-regular graph with strongly closed subgraphs
• A note on distance-regular graphs with a small number of vertices compared to the valency
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Distance-regular graphs with or at least half the valency
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Improving diameter bounds for distance-regular graphs
• Interlacing eigenvalues and graphs
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• On subgraphs in distance-regular graphs
• Problems in algebraic combinatorics
• Strongly regular graphs with smallest eigenvalue -m
• There are only finitely many distance-regular graphs of fixed valency greater than two

This page was built for publication: There are only finitely many distance-regular graphs with valency \(k\) at least three, fixed ratio \(\frac{k_2}{k}\) and large diameter

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