The graphs with all but two eigenvalues equal to $-2$ or $0$

Jason R. Vermette; Sebastian M. Cioaba; Willem H. Haemers

arxiv: 1601.05604 · v3 · pith:BL53UHD4new · submitted 2016-01-21 · 🧮 math.CO

The graphs with all but two eigenvalues equal to -2 or 0

Sebastian M. Cioaba , Willem H. Haemers , Jason R. Vermette This is my paper

classification 🧮 math.CO

keywords graphsadjacencydetermineeigenvaluesequaldeterminedincludedmatrix

0 comments

read the original abstract

We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency spectrum.

This paper has not been read by Pith yet.

The graphs with all but two eigenvalues equal to -2 or 0

discussion (0)