Now showing items 171-171 of 171
On split graphs with four distinct eigenvalues
(Discrete Applied Mathematics, 2020)
It is a well-known fact that a graph of diameter d has at least d + 1 eigenvalues. A graph is d-extremal, if it has diameter d and exactly d+1 eigenvalues. A graph is split if its vertex set can be partitioned into a ...