More spectral bounds on the clique and independence numbers

2007/06/04 by Vladimir Nikiforov, Nikiforov, Vladimir · 3 citations
Mathematics · #05C50 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.0706.0548

openalex publication_date 2007/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

Cited by

• A survey of edge-spectral-Turán type problems in spectral graph theory: Results, conjectures and open problems
• An edge-spectral Erdős-Stone-Simonovits theorem and its stability
• Strong spectral stabilities for C_2k+1-free graphs

Related

• Spectral bounds for the k-independence number of a graph
• Eigenvalue bounds for independent sets
• Bounds on graph eigenvalues I
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• On the k-independence number of graphs