There are only finitely many distance-regular graphs of fixed valency greater than two

Sejeong Bang; Arturas Dubickas; Jack Koolen; Vincent Moulton

doi:10.1016/j.aim.2014.09.025

There are only finitely many distance-regular graphs of fixed valency greater than two

Sejeong Bang, Arturas Dubickas, Jack Koolen, Vincent Moulton

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

22 Citations (Scopus)

17 Downloads (Pure)

Abstract

In this paper we prove the Bannai–Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.

Original language	English
Pages (from-to)	1-55
Number of pages	55
Journal	Advances in Mathematics
Volume	269
Early online date	22 Oct 2014
DOIs	https://doi.org/10.1016/j.aim.2014.09.025
Publication status	Published - 10 Jan 2015

Keywords

Distance-regular graphs
Bannai–Ito conjecture
Sims conjecture
Othogonal polynomials
Christoffel numbers

Access to Document

10.1016/j.aim.2014.09.025

submitted-sept2014Accepted author manuscript, 412 KBLicence: CC BY-NC-ND

Vincent Moulton
- v.moultonuea.acuk
- School of Computing Sciences - Professor in Computational Biology
- Norwich Epidemiology Centre - Member
- Computational Biology - Member
Person: Research Group Member, Academic, Teaching & Research

Cite this

@article{bad994fee9474f38b2a2522834d8262e,

title = "There are only finitely many distance-regular graphs of fixed valency greater than two",

abstract = "In this paper we prove the Bannai–Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.",

keywords = "Distance-regular graphs, Bannai–Ito conjecture, Sims conjecture, Othogonal polynomials, Christoffel numbers",

author = "Sejeong Bang and Arturas Dubickas and Jack Koolen and Vincent Moulton",

year = "2015",

month = jan,

day = "10",

doi = "10.1016/j.aim.2014.09.025",

language = "English",

volume = "269",

pages = "1--55",

journal = "Advances in Mathematics",

issn = "0001-8708",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - There are only finitely many distance-regular graphs of fixed valency greater than two

AU - Bang, Sejeong

AU - Dubickas, Arturas

AU - Koolen, Jack

AU - Moulton, Vincent

PY - 2015/1/10

Y1 - 2015/1/10

N2 - In this paper we prove the Bannai–Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.

AB - In this paper we prove the Bannai–Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.

KW - Distance-regular graphs

KW - Bannai–Ito conjecture

KW - Sims conjecture

KW - Othogonal polynomials

KW - Christoffel numbers

U2 - 10.1016/j.aim.2014.09.025

DO - 10.1016/j.aim.2014.09.025

M3 - Article

VL - 269

SP - 1

EP - 55

JO - Advances in Mathematics

JF - Advances in Mathematics

SN - 0001-8708

ER -

There are only finitely many distance-regular graphs of fixed valency greater than two

Abstract

Keywords

Access to Document

Profiles

Vincent Moulton

Cite this