Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2

DOI10.1080/03081089508818380zbMath0832.05077OpenAlexW2075300367MaRDI QIDQ4853926

Slobodan K. Simic

Publication date: 11 December 1995

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089508818380

zbMATH Keywords

characterizationsecond largest eigenvaluespectral graph theoryforbidden subgraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (7)

Some graph mappings that preserve the sign of λ2 - r ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ The polynomial reconstruction problem: the first 50 years ⋮ A survey of automated conjectures in spectral graph theory ⋮ Maximal reflexive cacti with four cycles: The approach via Smith graphs ⋮ Graphs with all but two eigenvalues in \([-2, 0\)] ⋮ Reflexive line graphs of trees

Cites Work

• A table of connected graphs on six vertices
• Recent results in the theory of graph spectra
• Linear Separation of Dominating Sets in Graphs
• Graphs characterized by the second eigenvalue

This page was built for publication: Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2