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

DOI10.7151/dmgt.2286zbMath1433.05181OpenAlexW2998069276MaRDI QIDQ2295993

André Brondani, Jorge Alencar, Leonardo Silva de Lima, Carla Oliveira, Nair Maria Maia De Abreu

Publication date: 17 February 2020

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

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

zbMATH Keywords

complete multipartite graphgraph spectrumgraph determined by its spectrum

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reflexive line graphs of trees
• Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
• Notes on the second largest eigenvalue of a graph
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices
• Spectra of graphs
• On the spectrum of a complete multipartite graph
• On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• The non-bipartite graphs with all but two eigenvalues in [–1, 1]
• Graphs characterized by the second eigenvalue
• Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2

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