Spectra of weighted uniform hypertrees
From MaRDI portal
Publication:2144325
DOI10.37236/10942zbMath1491.05128arXiv2203.15339OpenAlexW4226214830MaRDI QIDQ2144325
Fu-Tao Hu, Yi Wang, Jiang-Chao Wan
Publication date: 13 June 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.15339
Trees (05C05) Graph polynomials (05C31) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (2)
Even order uniform hypergraph via the Einstein product ⋮ Hypergraph analysis based on a compatible tensor product structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicities of tensor eigenvalues
- Connected hypergraphs with small spectral radius
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- Matching theory
- On the adjacency spectra of hypertrees
- Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
- A bound on the spectral radius of hypergraphs with \(e\) edges
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- The matching polynomials and spectral radii of uniform supertrees
- The spectra of uniform hypertrees
- Eigenvalues of a real supersymmetric tensor
- The characteristic polynomial of a graph
- Theory of monomer-dimer systems
- Computing Tensor Eigenvalues via Homotopy Methods
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- On the theory of the matching polynomial
- Computing hypermatrix spectra with the Poisson product formula
- Most Tensor Problems Are NP-Hard
- Generalized Tensor Eigenvalue Problems
This page was built for publication: Spectra of weighted uniform hypertrees
