There are finitely many triangle-free distance-regular graphs with degree 8, 9, or 10

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

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

Original language	English
Pages (from-to)	205-217
Number of pages	13
Journal	Journal of Algebraic Combinatorics
Volume	19
Issue number	2
DOIs	https://doi.org/10.1023/B:JACO.0000023006.04375.60
Publication status	Published - 2004

@article{3789a48fbd2043f0831835c5b2d60a58,

title = "There are finitely many triangle-free distance-regular graphs with degree 8, 9, or 10",

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

author = "J. Koolen and V. Moulton",

year = "2004",

doi = "10.1023/B:JACO.0000023006.04375.60",

language = "English",

volume = "19",

pages = "205--217",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - There are finitely many triangle-free distance-regular graphs with degree 8, 9, or 10

AU - Koolen, J.

AU - Moulton, V.

PY - 2004

Y1 - 2004

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

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

U2 - 10.1023/B:JACO.0000023006.04375.60

DO - 10.1023/B:JACO.0000023006.04375.60

M3 - Article

SN - 0925-9899

VL - 19

SP - 205

EP - 217

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 2

ER -