The algebraic multiplicity of the spectral radius of a uniform hypertree
From MaRDI portal
Publication:6635173
DOI10.37236/12240MaRDI QIDQ6635173
Publication date: 9 November 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of uniform hypergraphs
- Perron-Frobenius theorem for nonnegative tensors
- Le formalisme du résultant. (The formalism of resultant)
- On the adjacency spectra of hypertrees
- The matching polynomials and spectral radii of uniform supertrees
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges
- On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
- The spectra of uniform hypertrees
- Eigenvalues of a real supersymmetric tensor
- Using Algebraic Geometry
- Computing hypermatrix spectra with the Poisson product formula
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- Spectra of power hypergraphs and signed graphs via parity-closed walks
This page was built for publication: The algebraic multiplicity of the spectral radius of a uniform hypertree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635173)