On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7

J. Koolen; V. Moulton

doi:10.1006/eujc.2002.0609

On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7

J. Koolen, V. Moulton

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

6 Citations (Scopus)

Abstract

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.

Original language	English
Pages (from-to)	987-1006
Number of pages	20
Journal	European Journal of Combinatorics
Volume	23
Issue number	8
DOIs	https://doi.org/10.1006/eujc.2002.0609
Publication status	Published - Nov 2002

Access to Document

10.1006/eujc.2002.0609Licence: Other

Cite this

@article{e8df795a263f4516a90d6b35410b187c,

title = "On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7",

abstract = "Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.",

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

year = "2002",

month = nov,

doi = "10.1006/eujc.2002.0609",

language = "English",

volume = "23",

pages = "987--1006",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press Inc.",

number = "8",

}

TY - JOUR

T1 - On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7

AU - Koolen, J.

AU - Moulton, V.

PY - 2002/11

Y1 - 2002/11

N2 - Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.

AB - Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.

U2 - 10.1006/eujc.2002.0609

DO - 10.1006/eujc.2002.0609

M3 - Article

VL - 23

SP - 987

EP - 1006

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 8

ER -