Two theorems concerning the Bannai-Ito conjecture

DOI10.1016/j.ejc.2006.08.009zbMath1121.05126OpenAlexW2025693709WikidataQ123025660 ScholiaQ123025660MaRDI QIDQ2643848

Sejeong Bang, Jack H. Koolen, Vincent L. Moulton

Publication date: 27 August 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.08.009

zbMATH Keywords

distance-regular graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

There are only finitely many distance-regular graphs of fixed valency greater than two, There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three, There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency, Commutative association schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• Eigenvalue multiplicities of highly symmetric graphs
• An improvement of the Ivanov bound
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• Improving diameter bounds for distance-regular graphs