The smallest eigenvalue of K_p-free graphs

2004/10/08 by Vladimir Nikiforov, V. Nikiforov, Nikiforov, V.
Computer Science · Mathematics · #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO #msc:05C35

paper · pdf · doi:10.48550/arxiv.math/0410216

4 pages

arxiv created 2004/10/08 · openalex publication_date 2004/10/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.

Related

• Some observations on the smallest adjacency eigenvalue of a graph
• Eigenvalues and forbidden subgraphs I
• The least eigenvalue of the complements of graphs with given connectivity
• Combinatorial upper bounds for the smallest eigenvalue of a graph
• Note on the product of the largest and the smallest eigenvalue of a graph