Graphs with Few Eigenvalues
- 3.3k Downloads
Graphs with few distinct eigenvalues tend to have some kind of regularity. A graph with only one eigenvalue (for A, L, or Q) is edgeless, and a connected graph with two distinct adjacency eigenvalues (for A, L, or Q) is complete.
Unable to display preview. Download preview PDF.