Distance-regular graphs with small number of distinct distance eigenvalues
From MaRDI portal
Recommendations
- Distance-regular graphs with a relatively small eigenvalue multiplicity
- Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
- Some results on the eigenvalues of distance-regular graphs
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Non-bipartite distance-regular graphs with a small smallest eigenvalue
- Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
- Eigenvectors of Distance-Regular Graphs
- On the multiplicity of eigenvalues of distance-regular graphs
- Distance-regular graphs with an eigenvalue of multiplicity four
- On the distance spectrum of distance regular graphs
Cites work
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- Combinatorial Designs
- Coverings of complete bipartite graphs and associated structures
- Distance-Regular Graphs with Diameter Three
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3510326 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On the distance spectra of graphs
- On the distance spectrum of distance regular graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Some spectral inequalities for triangle-free regular graphs
- Spectral characterizations of some distance-regular graphs
- The second largest eigenvalues of regular bipartite graphs
Cited in
(18)- A characterization of distance-regular graphs with diameter three
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Regular graphs with four eigenvalues
- On main eigenvalues of chain graphs
- On the distance spectrum of minimal cages and associated distance biregular graphs
- On the distance spectrum of distance regular graphs
- Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
- Graphs with three distinct distance eigenvalues
- On graphs with distinct eigenvalues
- scientific article; zbMATH DE number 4045789 (Why is no real title available?)
- scientific article; zbMATH DE number 832234 (Why is no real title available?)
- scientific article; zbMATH DE number 7090170 (Why is no real title available?)
- On the distance spectra ofm-generationn-prism graph
- Distance-regular graphs with exactly one positive q-distance eigenvalue
- Distance-regular graphs with a few q-distance eigenvalues
- On the distance eigenvalues of design graphs
- On an infinite family of integral and distance integral Cayley graphs with few distance eigenvalues
- Some results on the eigenvalues of distance-regular graphs
This page was built for publication: Distance-regular graphs with small number of distinct distance eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402442)