Spectral hypergraph theory of the adjacency hypermatrix and matroids
From MaRDI portal
Publication:471932
DOI10.1016/j.laa.2014.09.025zbMath1302.05110OpenAlexW2046557986MaRDI QIDQ471932
Publication date: 17 November 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.025
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matroids and geometric lattices (05B35) Multilinear algebra, tensor calculus (15A69)
Related Items
On spectral theory of a k-uniform directed hypergraph ⋮ The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices ⋮ Spectra of general hypergraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
- Spectra of uniform hypergraphs
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- On spectral hypergraph theory of the adjacency tensor
- Perron-Frobenius theorem for nonnegative tensors
- The number of eigenvalues of a tensor
- Eigenvalues of a real supersymmetric tensor
- On eigenvalue problems of real symmetric tensors
- A survey on the spectral theory of nonnegative tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Shifted Power Method for Computing Tensor Eigenpairs
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
This page was built for publication: Spectral hypergraph theory of the adjacency hypermatrix and matroids