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.
Recommendations
- On the principal eigenvectors of uniform hypergraphs
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Principal eigenvectors of nonnegative tensors and hypergraphs
- Principal eigenvectors of nonnegative tensors and hypergraphs
- The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs
- Comparing the principal eigenvector of a hypergraph and its shadows
- Principal eigenvectors of irregular graphs
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- Eigenvalues and linear quasirandom hypergraphs
Cites work
- A general product of tensors with applications
- Eigenvalues of a real supersymmetric tensor
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- On the principal eigenvectors of uniform hypergraphs
- On the second eigenvalue of hypergraphs
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Principal eigenvectors of irregular graphs
- Some inequalities on the Perron eigenvalue and eigenvectors for positive tensors
- Some properties of the spectral radius for general hypergraphs
- Spectra of general hypergraphs
- Spectra of hypergraphs and applications
- Spectra of uniform hypergraphs
- Spectral properties of general hypergraphs
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs
- The spectrum of a class of uniform hypergraphs
Cited in
(8)- Principal eigenvectors and spectral radii of uniform hypergraphs
- Principal eigenvector of the signless Laplacian matrix
- On the adjacency matrix of graphs: principal eigenvector versus degree vector
- On the principal eigenvectors of uniform hypergraphs
- ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- The maximum principal ratio of graphs
- Principal eigenvectors in hypergraph Turán problems
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)