On the spectral radii and principal eigenvectors of uniform hypergraphs
From MaRDI portal
Publication:5370821
DOI10.1142/S1793830917500483zbMath1372.05131MaRDI QIDQ5370821
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)
Related Items (4)
Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs ⋮ Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees ⋮ Principal eigenvectors of general hypergraphs ⋮ Some classifications of graphs with respect to a set adjacency relation
Cites Work
- On the principal eigenvectors of uniform hypergraphs
- Symmetric nonnegative tensors and copositive tensors
- Spectra of uniform hypergraphs
- Perron-Frobenius theorem for nonnegative tensors
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Hypergraph theory. An introduction
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Analytic methods for uniform hypergraphs
- A general product of tensors with applications
- Eigenvalues of a real supersymmetric tensor
- Eigenvectors and eigenvalues of non-regular graphs
- Spectral Radius and Degree Sequence
This page was built for publication: On the spectral radii and principal eigenvectors of uniform hypergraphs