There are only finitely many distance-regular graphs of fixed valency greater than two
From MaRDI portal
Publication:475256
DOI10.1016/j.aim.2014.09.025zbMath1303.05044arXiv0909.5253OpenAlexW2080815958WikidataQ56673208 ScholiaQ56673208MaRDI QIDQ475256
Sejeong Bang, Jack H. Koolen, Arturas Dubickas, Vincent L. 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
Related Items (21)
The search for small association schemes with noncyclotomic eigenvalues ⋮ On bounding the diameter of a distance-regular graph ⋮ Classification of partially metric Q-polynomial association schemes with \(m_1=4\) ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes ⋮ Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane ⋮ An inequality involving the second largest and smallest eigenvalue of a distance-regular graph ⋮ Geometric aspects of 2-walk-regular graphs ⋮ On geometric distance-regular graphs with diameter three ⋮ A new characterization of the dual polar graphs ⋮ On the Calculation of Multiplicities forP-PolynomialC-Algebras ⋮ Which graphs have non-integral spectra? ⋮ Non-bipartite distance-regular graphs with a small smallest eigenvalue ⋮ On the spectral gap and the automorphism group of distance-regular graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Distance-regular Cayley graphs with small valency ⋮ Distance-regular graphs without 4-claws ⋮ Scaling limits for the Gibbs states on distance-regular graphs with classical parameters ⋮ A survey of semisimple algebras in algebraic combinatorics ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
Cites Work
- On distance-regular graphs with fixed valency
- On distance-regular graphs with fixed valency. II
- There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
- Association schemes of quadratic forms
- 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
- Coherent configurations. I: Ordinary representation theory
- 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}\)
- The nonexistence of certain generalized polygons
- Graphs and finite permutation groups
- A new family of distance-regular graphs with unbounded diameter
- Two theorems concerning the Bannai-Ito conjecture
- On the Sims Conjecture and Distance Transitive Graphs
- There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
- Cubic Distance-Regular Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: There are only finitely many distance-regular graphs of fixed valency greater than two
