Distance-regular graphs of diameter 3 having eigenvalue -1
From MaRDI portal
Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
Recommendations
Cites work
- A note on distance-regular graphs with a small number of vertices compared to the valency
- Characterizing distance-regularity of graphs by the spectrum
- Distance regular graphs of diameter 3 and strongly regular graphs
- Distance-regular graphs
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Strongly regular graphs with smallest eigenvalue -m
Cited in
(12)- A valency bound for distance-regular graphs
- Graphs whose distance matrix has at most three negative eigenvalues
- Inverse problems in the theory of distance-regular graphs: dual 2-designs
- 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
- Distance-regular graphs without 4-claws
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
- scientific article; zbMATH DE number 4045789 (Why is no real title available?)
- ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE =1
- On distance-regular graphs of diameter 3 with eigenvalue 0
This page was built for publication: Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402439)