There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2k and large diameter

Jongyook Park, Jack H. Koolen, Greg Markowsky

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

In this paper, we show that for given positive integer C, there are only finitely many distance-regular graphs with valency k at least three, diameter D at least six and k2/k≤C. This extends a conjecture of Bannai and Ito.

Original languageEnglish
Pages (from-to)733-741
Number of pages9
JournalJournal of Combinatorial Theory. Series B
Volume103
Issue number6
DOIs
StatePublished - Nov 2013

Keywords

  • Bannai-Ito conjecture
  • Distance-regular graphs

Fingerprint

Dive into the research topics of 'There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2k and large diameter'. Together they form a unique fingerprint.

Cite this