Abstract
Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues and arbitrarily many distinct valencies. The graphs with four distinct eigenvalues come from regular two-graphs. As a side result, we characterize the disconnected graphs and the graphs with three distinct eigenvalues in the switching class of a regular two-graph.
Original language | English |
---|---|
Article number | 3 |
Pages (from-to) | 12-24 |
Journal | Electronic Journal of Linear Algebra |
Volume | 28 |
DOIs | |
Publication status | Published - Apr 2015 |
Keywords
- Eigenvalues of graphs
- non-regular graphs
- few eigenvalues
- strong graphs
- regular two-graphs
- Seidel switching