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

DOI10.1016/J.EJC.2007.06.010MaRDI QIDQ925022zbMATH OpenOpenAlexFDO

Authors Kris Coolsaet, Aleksandar Jurišić, 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)

Recommendations

• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• On the multiplicity of eigenvalues of distance-regular graphs
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• Triangle-free distance-regular graphs

Cites work

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

Cited in

(8)

• Resistance characterizations of equiarboreal graphs
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• The multiplicity of \(A_{\alpha}\)-eigenvalues of graphs
• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• Eigenvalue multiplicity in triangle-free graphs
• Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
• Distance-regular graphs with light tails
• Line star sets for Laplacian eigenvalues

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

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