The graphs with all but two eigenvalues equal to $-2$ or $0$
Combinatorics
2016-07-11 v3
Abstract
We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to , or , and determine which of these graphs are determined by their adjacency spectrum.
Cite
@article{arxiv.1601.05604,
title = {The graphs with all but two eigenvalues equal to $-2$ or $0$},
author = {Sebastian M. Cioaba and Willem H. Haemers and Jason R. Vermette},
journal= {arXiv preprint arXiv:1601.05604},
year = {2016}
}