Restrictions on classical distance-regular graphs

DOI10.1007/s10801-017-0765-3zbMath1456.05180OpenAlexW2620195106MaRDI QIDQ1686223

Aleksandar Jurišić, Janoš Vidali

Publication date: 21 December 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-017-0765-3

zbMATH Keywords

distance-regular graphslocally strongly regulartight graphsclassical parametersformally self-dual

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (4)

Further study of distance-regular graphs with classical parameters with \(b < -1\) ⋮ On tight 4-designs in Hamming association schemes ⋮ On few-class Q-polynomial association schemes: feasible parameters and nonexistence results ⋮ Using symbolic computation to prove nonexistence of distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
• Extremal 1-codes in distance-regular graphs of diameter 3
• Nonexistence of a class of distance-regular graphs
• On \(Q\)-polynomial regular near \(2d\)-gons
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
• Characterization of H(n,q) by the parameters
• A characterization of the association schemes of Hermitian forms
• Strongly regular graphs with smallest eigenvalue -m
• On a characterization of bilinear forms graphs
• Classical distance-regular graphs of negative type
• Homogeneous graphs and regular near polygons
• 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
• Tight distance-regular graphs
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• Kite-free distance-regular graphs
• A characterization of Grassmann graphs
• A note on triangle-free distance-regular graphs with \(a_2\neq 0\)
• A new family of distance-regular graphs with unbounded diameter
• Strongly regular graphs, partial geometries and partially balanced designs
• A local approach to 1-homogeneous graphs
• Tight distance-regular graphs and the \(Q\)-polynomial property

This page was built for publication: Restrictions on classical distance-regular graphs