The graphs with all but two eigenvalues equal to \(-2\) or 0
From MaRDI portal
Publication:2364633
DOI10.1007/s10623-016-0241-4zbMath1367.05125arXiv1601.05604OpenAlexW2007261081WikidataQ59611962 ScholiaQ59611962MaRDI QIDQ2364633
Jason R. Vermette, Sebastian M. Cioabă, Willem H. Haemers
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.05604
Related Items
Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ On 2-equitable graphs ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Graphs with two main and two plain eigenvalues ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ On graphs with exactly one anti-adjacency eigenvalue and beyond ⋮ Complex unit gain graphs with exactly one positive eigenvalue ⋮ Graphs with all but two eigenvalues in \([-2, 0\)] ⋮ Spectral characterization of mixed extensions of small graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ Hermitian adjacency matrix of the second kind for mixed graphs ⋮ Spectral determination of graphs with one positive anti-adjacency eigenvalue
Cites Work
