Restrictions on classical distance-regular graphs

DOI10.1007/S10801-017-0765-3MaRDI QIDQ1686223zbMATH OpenOpenAlexFDO

Authors 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 graphsclassical parameterstight graphslocally strongly regularformally self-dual

Mathematics Subject Classification ID

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

Recommendations

• Classical distance-regular graphs of negative type
• scientific article; zbMATH DE number 3906524
• scientific article; zbMATH DE number 1379441
• Tight distance-regular graphs
• Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)

Cites work

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

Cited in

(7)

• Distance-regular graph with intersection array \(\{143,108,27;1,12,117\}\) does not exist
• On tight 4-designs in Hamming association schemes
• Further study of distance-regular graphs with classical parameters with \(b < -1\)
• Some remarks on the parameter \(c_2\) for a distance-regular graph with classical parameters
• On the (non-)existence of tight distance-regular graphs: a local approach
• On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
• Using symbolic computation to prove nonexistence of distance-regular graphs

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

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