Two theorems concerning the Bannai-Ito conjecture

DOI10.1016/J.EJC.2006.08.009MaRDI QIDQ2643848zbMATH OpenOpenAlexWikidataFDO

Authors Sejeong Bang, Jack H. Koolen, Vincent 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)

Recommendations

• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• On distance-regular graphs with \(k_ i=k_ j\)
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2
• Some interlacing results for the eigenvalues of distance-regular graphs

Cites work

• An improvement of the Ivanov bound
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Eigenvalue multiplicities of highly symmetric graphs
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3878961 (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
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• 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
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10

Cited in

(8)

• There are finitely many Q-polynomial association schemes with given first multiplicity at least three
• Commutative association schemes
• Some interlacing results for the eigenvalues of distance-regular graphs
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• There are only finitely many distance-regular graphs of fixed valency greater than two
• A short proof of a theorem of Bannai and Ito

This page was built for publication: Two theorems concerning the Bannai-Ito conjecture

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