There are Finitely Many Triangle-Free Distance-Regular Graphs with Degree 8, 9 or 10

Authors:
J. H. Koolen;V. Moulton
Affiliations:
Division of Applied Mathematics, KAIST 373-1 Kusongdong, Yusongku Deajon, 305 701 Korea. jhk@euclid.postech.ac.kr;The Linnaeus Centre for Bioinformatics, Uppsala University, BMC, Box 598, 751 24 Uppsala, Sweden. vincent.moulton@lcb.uu.se
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2004

Citing 1
Cited 6

On distance-regular graphs with fixed valency, IV

European Journal of Combinatorics

A bound for the number of columns ℓ(c,a,b) in the intersection array of a distance-regular graph

European Journal of Combinatorics
Some Interlacing Results for the Eigenvalues of Distance-regular graphs

Designs, Codes and Cryptography
Two theorems concerning the Bannai-Ito conjecture

European Journal of Combinatorics
Triangle-free distance-regular graphs

Journal of Algebraic Combinatorics: An International Journal
There are finitely many Q-polynomial association schemes with given first multiplicity at least three

European Journal of Combinatorics
Commutative association schemes

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we prove that there are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10.