A combinatorial bound on the number of distinct eigenvalues of a graph

Sarah Allred, Craig Erickson, Kevin Grace +2

The smallest possible number of distinct eigenvalues of a graph $G$, denoted by $q(G)$, has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…