A lower bound on the entries of the principal eigenvector of a graph
classification
🧮 math.CO
keywords
boundeigenvectorgraphlowerprincipalconnectedentriesentry
read the original abstract
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.