Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
From MaRDI portal
Publication:2462330
DOI10.1016/j.ejc.2006.10.001zbMath1133.05104OpenAlexW2014797604MaRDI QIDQ2462330
Arjana Žitnik, Jack H. Koolen, Aleksandar Jurišić
Publication date: 30 November 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.10.001
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ Distance-regular graphs with light tails ⋮ Unnamed Item
Cites Work
- Unnamed Item
- On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
- Eigenvalue multiplicities of highly symmetric graphs
- Distance regular covers of the complete graph
- Problems in algebraic combinatorics
- \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
- A family of antipodal distance-regular graphs related to the classical Preparata codes
- Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- Distance-Regular Graphs with Diameter Three
This page was built for publication: Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3