Graphs with large clique number whose second largest eigenvalue does not exceed (5-1)/2

DOI10.37236/13017MaRDI QIDQ6987879zbMATH OpenFDO

Authors Muhuo Liu, Chaohui Chen, Zoran Stanić, Hai-Ying Shan

Publication date 6 May 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13017

zbMATH Keywords

clique numbergolden sectionlargest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• Almost controllable graphs and beyond
• Cliques and the spectral radius
• Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
• Explicit construction of linear sized tolerant networks
• Graphs characterized by the second eigenvalue
• Graphs with second largest eigenvalue less than 1/2
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• scientific article; zbMATH DE number 3825855 (Why is no real title available?)
• scientific article; zbMATH DE number 3668627 (Why is no real title available?)
• scientific article; zbMATH DE number 3737716 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Inequalities for Graph Eigenvalues
• On generalized -graphs whose second largest eigenvalue does not exceed 1
• On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
• On graphs whose second largest eigenvalue is at most 1
• On graphs with exactly one eigenvalue less than -1
• On the second largest eigenvalue of line graphs
• Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
• Some notes on spectra of cographs.
• Spectral bounds for the clique and independence numbers of graphs
• Spectral properties of cographs and P₅-free graphs
• The rank of a cograph
• The smallest eigenvalue of \(K_{r}\)-free graphs
• The spread of the spectrum of a graph
• Walks and the spectral radius of graphs

Cited in

(2)

• Connected claw-free graphs whose second largest eigenvalue does not exceed 1
• On K₄-minor free graphs whose second largest eigenvalue does not exceed 1

This page was built for publication: Graphs with large clique number whose second largest eigenvalue does not exceed \((\sqrt{5}-1)/2\)

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