Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
From MaRDI portal
Publication:2402439
DOI10.1016/j.laa.2017.05.038zbMath1370.05130OpenAlexW2618977343MaRDI QIDQ2402439
Publication date: 7 September 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.038
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (5)
Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) ⋮ Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\) ⋮ Inverse problems of graph theory: graphs without triangles ⋮ Inverse problems in the theory of distance-regular graphs: dual 2-designs ⋮ Distance-regular graphs without 4-claws
Cites Work
- Unnamed Item
- Distance-regular graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Characterizing distance-regularity of graphs by the spectrum
- Strongly regular graphs with smallest eigenvalue -m
- A note on distance-regular graphs with a small number of vertices compared to the valency
This page was built for publication: Distance-regular graphs of diameter 3 having eigenvalue \(-1\)