Principal eigenvectors of general hypergraphs

From MaRDI portal



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.












This page was built for publication: Principal eigenvectors of general hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959333)