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

DOI10.1016/J.AIM.2014.09.025MaRDI QIDQ475256zbMATH OpenOpenAlexWikidataFDO

Authors Sejeong Bang, Jack H. Koolen, A. Dubickas, Vincent Moulton

Publication date 26 November 2014

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.5253

zbMATH Keywords

distance-regular graphsBannai-Ito conjectureChristoffel numbersothogonal polynomialssims conjecture

Mathematics Subject Classification ID

Distance in graphs (05C12)

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.

Recommendations

• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
• Distance-regular graphs with or at least half the valency
• On distance-regular graphs with fixed valency. IV
• A valency bound for distance-regular graphs
• On distance-regular graphs with fixed valency. III
• scientific article; zbMATH DE number 3981222
• A note on distance-regular graphs with a small number of vertices compared to the valency

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• scientific article; zbMATH DE number 4156783 (Why is no real title available?)
• scientific article; zbMATH DE number 3689291 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3492731 (Why is no real title available?)
• scientific article; zbMATH DE number 1303108 (Why is no real title available?)
• scientific article; zbMATH DE number 475365 (Why is no real title available?)
• scientific article; zbMATH DE number 3432305 (Why is no real title available?)
• scientific article; zbMATH DE number 3412694 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3189389 (Why is no real title available?)
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
• A new family of distance-regular graphs with unbounded diameter
• Association schemes of quadratic forms
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Coherent configurations. I: Ordinary representation theory
• Cubic Distance-Regular Graphs
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Distance-regular graphs of valency 6 and \(a_1=1\)
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Graphs and finite permutation groups
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• On the Sims Conjecture and Distance Transitive Graphs
• The nonexistence of certain generalized polygons
• There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• There are only finitely many finite distance-transitive graphs of given valency greater than two
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• Two theorems concerning the Bannai-Ito conjecture

Cited in

(24)

• The search for small association schemes with noncyclotomic eigenvalues
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• On bounding the diameter of a distance-regular graph
• On the (non-)existence of tight distance-regular graphs: a local approach
• On geometric distance-regular graphs with diameter three
• Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
• A survey of semisimple algebras in algebraic combinatorics
• Spectral determinations and eccentricity matrix of graphs
• On the Calculation of Multiplicities forP-PolynomialC-Algebras
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Which graphs have non-integral spectra?
• Distance-regular Cayley graphs with small valency
• Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
• Geometric aspects of 2-walk-regular graphs
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• On the spectral gap and the automorphism group of distance-regular graphs
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Distance-regular graphs without 4-claws
• A new characterization of the dual polar graphs
• Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane

This page was built for publication: There are only finitely many distance-regular graphs of fixed valency greater than two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475256)