Graphs with three distinct eigenvalues and largest eigenvalue less than 8
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Line graphs, root systems, and elliptic geometry
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On graphs with three eigenvalues
- Regular graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- Which graphs are determined by their spectrum?
Cited in
(19)- A problem concerning graphs with just three distinct eigenvalues
- Graphs with few distinct eigenvalues and extremal energy
- Some new aspects of main eigenvalues of graphs
- Largest regular multigraphs with three distinct eigenvalues
- On the distance spectrum of graphs
- Biregular graphs with three eigenvalues
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- Eigenvalues of graphs with vertices of large degree at distance three apart
- Graphs whose certain polynomials have few distinct roots
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Graphs with many valencies and few eigenvalues
- Universal adjacency matrices with two eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- Fluctuations in mean-field Ising models
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
- Digraphs with few distinct eigenvalues
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Equiangular lines in Euclidean spaces
This page was built for publication: Graphs with three distinct eigenvalues and largest eigenvalue less than 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014470)
