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

2010/12/13 by Jongyook Park, Park, Jongyook, Jack H. Koolen +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1012.2632

openalex publication_date 2010/12/13 · openalex created_date 2022/08/15 · openalex updated_date 2026/07/28

Abstract

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

Related

• There are only finitely many distance-regular graphs of fixed valency greater than two
• Distance-regular graph with large a1 or c2
• The least Euclidean distortion constant of a distance-regular graph
• Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
• Shilla distance-regular graphs