Graphs with all but two eigenvalues in [-2, 0]

DOI10.7151/DMGT.2286MaRDI QIDQ2295993zbMATH OpenOpenAlexFDO

Authors Jorge Alencar, André Brondani, Leonardo Silva de Lima, Carla Oliveira, Nair Abreu

Publication date 17 February 2020

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2286

zbMATH Keywords

graph spectrumcomplete multipartite graphgraph determined by its spectrum

Mathematics Subject Classification ID

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

Recommendations

• The graphs with all but two eigenvalues equal to \(-2\) or 0
• The non-bipartite graphs with all but two eigenvalues in \([-1,1]\)
• 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\)

Cites work

• scientific article; zbMATH DE number 3825855 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 940718 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Graphs characterized by the second eigenvalue
• Notes on the second largest eigenvalue of a graph
• On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices
• On the spectrum of a complete multipartite graph
• Reflexive line graphs of trees
• Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
• Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
• Spectra of graphs
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The non-bipartite graphs with all but two eigenvalues in \([-1,1]\)

Cited in

(4)

• Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The non-bipartite graphs with all but two eigenvalues in \([-1,1]\)

This page was built for publication: Graphs with all but two eigenvalues in \([-2, 0]\)

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