Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency

DOI10.1016/j.jctb.2005.01.005zbMath1070.05084OpenAlexW2040437851MaRDI QIDQ2485947

Aleksandar Jurišić, Jack H. Koolen, Štefko Miklavič

Publication date: 5 August 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.01.005

zbMATH Keywords

almost 2-homogeneous graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

On bounding the diameter of a distance-regular graph ⋮ On triangle-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 ⋮ Triangle-free distance-regular graphs ⋮ Distance-regular graphs with light tails ⋮ A note on triangle-free distance-regular graphs with \(a_2\neq 0\) ⋮ Almost 2-homogeneous graphs and completely regular quadrangles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalue multiplicities of highly symmetric graphs
• Completely regular codes
• Homogeneous graphs and regular near polygons
• Problems in algebraic combinatorics
• Width and dual width of subsets in polynomial association schemes
• 2-homogeneous bipartite distance-regular graphs
• Almost 2-homogeneous bipartite distance-regular graphs
• Cycle-balance conditions for distance-regular graphs
• Spin models on bipartite distance-regular graphs
• Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
• Hadamard matrices and their applications

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