Sparsity of Graphs that Allow Two Distinct Eigenvalues

Wayne Barrett, Shaun Fallat, Veronika Furst +5

The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. It is shown that the minimum number of edg…