A reduction formula for the characteristic polynomial of hypergraph with pendant edges
DOI10.1016/J.LAA.2020.10.025zbMATH Open1459.05222OpenAlexW3094811916MaRDI QIDQ2228496FDOQ2228496
Authors: Lixiang Chen, Changjiang Bu 
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.10.025
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph polynomials (05C31) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Using Algebraic Geometry
- Title not available (Why is that?)
- Eigenvalues of a real supersymmetric tensor
- Connected hypergraphs with small spectral radius
- Spectra of uniform hypergraphs
- The Determinant of the Adjacency Matrix of a Graph
- Le formalisme du résultant. (The formalism of resultant)
- Title not available (Why is that?)
- On the eigenvalues of trees
- Cospectral Graphs and Digraphs
- Computing hypermatrix spectra with the Poisson product formula
- Some new trace formulas of tensors with applications in spectral hypergraph theory
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
Cited In (6)
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
- Spectral moments of hypertrees and their applications
- Algebraic and geometric multiplicities for some hypergraphs
- The algebraic multiplicity of the spectral radius of a uniform hypertree
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- The zero eigenvalue of the Laplacian tensor of a uniform hypergraph
This page was built for publication: A reduction formula for the characteristic polynomial of hypergraph with pendant edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228496)
