On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency

DOI10.1016/j.ejc.2007.06.010zbMath1182.05133OpenAlexW1991440953MaRDI QIDQ925022

Aleksandar Jurišić, Kris Coolsaet, Jack H. Koolen

Publication date: 29 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.010

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (5)

Resistance characterizations of equiarboreal graphs ⋮ Line star sets for Laplacian eigenvalues ⋮ Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 ⋮ Distance-regular graphs with light tails ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
• Eigenvalue multiplicities of highly symmetric graphs
• The distance-regular graphs of valency four
• Homogeneous graphs and regular near polygons
• Problems in algebraic combinatorics
• Tight distance-regular graphs
• Valency of distance-regular antipodal graphs with diameter 4
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• A family of antipodal distance-regular graphs related to the classical Preparata codes
• Spin models on bipartite distance-regular graphs
• Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• A New Family of Partially Balanced Incomplete Block Designs with Some Latin Square Design Properties
• A local approach to 1-homogeneous graphs

This page was built for publication: On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency