arXiv · 1909.00238
Principal eigenvectors of general hypergraphs
Abstract
In this paper we obtain bounds for the extreme entries of the principal eigenvector of hypergraphs; these bounds are computed using the spectral radius and some classical parameters such as maximum and minimum degrees. We also study inequalities involving the ratio and difference between the two extreme entries of this vector.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kauê Cardoso, Vilmar Trevisan. 2019-09-16. Principal eigenvectors of general hypergraphs. https://doi.org/10.1080/03081087.2019.1691491
Cite the original work for its findings. Save a collection to share your selection of sources.