Trees with very few eigenvalues
β
Robert A. Beezer
π
Article
π
1990
π
John Wiley and Sons
π
English
β 381 KB
## Abstract The number of distinct eigenvalues of the adjacency matrix of a graph is bounded below by the diameter of the graph plus one. Many graphs that achieve this lower bound exhibit much symmetry, for example, distanceβtransitive and distanceβregular graphs. Here we provide a recursive constr