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

DOI10.1007/S10623-016-0241-4MaRDI QIDQ2364633zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sebastian Cioaba, Willem H. Haemers, Jason R. Vermette

Publication date 21 July 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1601.05604

zbMATH Keywords

adjacency matrixgraph spectrumspectral characterizations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Recommendations

• Graphs with all but two eigenvalues in \([-2, 0]\)
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.
• The graphs with exactly two distance eigenvalues different from -1 and -3
• scientific article; zbMATH DE number 95308

Cites work

• Graphs cospectral with a friendship graph or its complement
• Graphs with many valencies and few eigenvalues
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• On the spectrum of a complete multipartite graph
• Spectra of graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)

Cited in

(22)

• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Hermitian adjacency matrix of the second kind for mixed graphs
• Spectral determination of graphs with one positive anti-adjacency eigenvalue
• 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 graphs with all but two eigenvalues equal to \(\pm 1\)
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• The non-bipartite graphs with all but two eigenvalues in \([-1,1]\)
• Notes on graphs with least eigenvalue at least -2
• scientific article; zbMATH DE number 459300 (Why is no real title available?)
• On graphs with three distinct signless Laplacian eigenvalues
• On 2-equitable graphs
• Universal adjacency matrices with two eigenvalues
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
• 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 1
• On split graphs with three or four distinct (normalized) Laplacian eigenvalues
• On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
• A complete characterization of non-bipartite graphs with all but two eigenvalues equal to 1 and 0

This page was built for publication: The graphs with all but two eigenvalues equal to \(-2\) or 0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364633)