A lower bound on the entries of the principal eigenvector of a graph
Combinatorics
2014-03-11 v2
Abstract
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
Cite
@article{arxiv.1403.1479,
title = {A lower bound on the entries of the principal eigenvector of a graph},
author = {Felix Goldberg},
journal= {arXiv preprint arXiv:1403.1479},
year = {2014}
}