Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
From MaRDI portal
Publication:2117517
Recommendations
- Non-bipartite distance-regular graphs with a small smallest eigenvalue
- Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
- Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- A valency bound for distance-regular graphs
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- A valency bound for distance-regular graphs
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- Cubic Distance-Regular Graphs
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- Distance-regular graphs
- Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
- Fractional decompositions and the smallest-eigenvalue separation
- Non-bipartite distance-regular graphs with a small smallest eigenvalue
- Some results on the eigenvalues of distance-regular graphs
- Spectra of graphs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- The distance-regular graphs of valency four
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- There are only finitely many distance-regular graphs of fixed valency greater than two
Cited in
(2)
This page was built for publication: Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117517)
