A lower bound on the entries of the principal eigenvector of a graph

2014/03/06 by Felix Goldberg, Goldberg, Felix
Computer Science · Mathematics · #05C50 #15A18 #15A42 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Random Matrices and Applications #math.CO #msc:05C50 #msc:15A18 #msc:15A42

paper · pdf · doi:10.48550/arxiv.1403.1479

openalex publication_date 2014/03/06 · arxiv created 2014/03/09 · arxiv updated 2014/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.

Citations

• Random matrices: Universality of local eigenvalue statistics

Related

• Bounds on graph eigenvalues I
• A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph
• Eigenvalues and forbidden subgraphs I
• Combinatorial upper bounds for the smallest eigenvalue of a graph
• On the principal eigenvector of a graph