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

DOI10.1016/J.AIM.2014.09.025zbMATH Open1303.05044arXiv0909.5253OpenAlexW2080815958WikidataQ56673208 ScholiaQ56673208MaRDI QIDQ475256FDOQ475256

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

Publication date: 26 November 2014

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The nonexistence of certain generalized polygons
• Coherent configurations. I: Ordinary representation theory
• A new family of distance-regular graphs with unbounded diameter
• Association schemes of quadratic forms
• Graphs and finite permutation groups
• On the Sims Conjecture and Distance Transitive Graphs
• There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Distance-regular graphs of valency 6 and \(a_1=1\)
• 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
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Two theorems concerning the Bannai-Ito conjecture
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• Cubic Distance-Regular Graphs
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II

Cited In (24)

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

Recommendations

• A note on distance-regular graphs with a small number of vertices compared to the valency 👍 👎
• Distance-regular graphs with or at least half the valency 👍 👎
• On distance-regular graphs with fixed valency. III 👍 👎
• On distance-regular graphs with fixed valency. IV 👍 👎
• A valency bound for distance-regular graphs 👍 👎
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency 👍 👎
• On distance-regular graphs with fixed valency 👍 👎
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) 👍 👎
• On distance-regular graphs with fixed valency. II 👍 👎
• Title not available (Why is that?) 👍 👎

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)