There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
From MaRDI portal
Publication:1826924
DOI10.1023/B:JACO.0000023006.04375.60zbMath1047.05043MaRDI QIDQ1826924
Jack H. Koolen, Vincent L. Moulton
Publication date: 6 August 2004
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Related Items (7)
Two theorems concerning the Bannai-Ito conjecture ⋮ A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ Triangle-free distance-regular graphs ⋮ 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
- 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
- On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
This page was built for publication: There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
