1 paper
Felix Goldberg, Steve Kirkland, Anu Varghese +1
It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. Let us call a graph \emph{d-extremal} if it has diameter d and exactly d+1 eigenvalues. S…