On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)

DOI10.1016/0012-365X(94)00204-VzbMath0842.05059MaRDI QIDQ1842163

Slobodan K. Simic, Dragos Cvetković

Publication date: 17 April 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00204-v

zbMATH Keywords

triangle; eigenvalues; forbidden induced subgraphs

Mathematics Subject Classification ID

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

Related Items

Some graph mappings that preserve the sign of λ2 - r, On signed graphs whose second largest Laplacian eigenvalue does not exceed 3, On the second largest distance eigenvalue, Almost controllable graphs and beyond, Reflexive line graphs of trees, Maximal reflexive cacti with four cycles: The approach via Smith graphs, On the extremal values of the second largest \(Q\)-eigenvalue, A survey of automated conjectures in spectral graph theory, On unicyclic graphs whose second largest eigenvalue does not exceed 1, On the second largest Laplacian eigenvalues of graphs, Graphs with the second signless Laplacian eigenvalue \(\leq 4\), Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\), Graphs with all but two eigenvalues in \([-2, 0\)], On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\), On bicyclic graphs whose second largest eigenvalue does not exceed 1, Graphs with second largest eigenvalue less than 1/2, The polynomial reconstruction problem: the first 50 years

Uses Software

• GRAPH

Cites Work

• A table of connected graphs on six vertices
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Discrete hyperbolic geometry
• Man-machine theorem proving in graph theory
• Ramanujan graphs
• Graph partitioning by eigenvectors
• On graphs with exactly one eigenvalue less than -1
• The second largest eigenvalue of a tree
• Cubic Ramanujan graphs
• Recent results in the theory of graph spectra
• Hyperbolic trees
• Parallel concepts in graph theory
• Explicit Concentrators from Generalized N-Gons
• Linear Separation of Dominating Sets in Graphs
• Graphs characterized by the second eigenvalue
• A Note on "The Comparability Graph of a Tree"
• On subdominantly bounded graphs — Summary of results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item