The characteristic polynomial of the complete 3-uniform hypergraph

DOI10.1016/j.laa.2021.06.016zbMath1470.05085OpenAlexW3182532644MaRDI QIDQ2041782

Ya-nan Zheng

Publication date: 23 July 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.2021.06.016

zbMATH Keywords

hypergraphspectrumcharacteristic polynomialresultant

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

On a relationship between the characteristic and matching polynomials of a uniform hypertree

Cites Work

• Spectra of uniform hypergraphs
• Perron-Frobenius theorem for nonnegative tensors
• Le formalisme du résultant. (The formalism of resultant)
• Algebraic connectivity of an even uniform hypergraph
• On the complexity of the multivariate resultant
• A combinatorial method for computing characteristic polynomials of starlike hypergraphs
• New and old results in resultant theory
• Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph
• Adjacency spectra of random and complete hypergraphs
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• Eigenvalues of a real supersymmetric tensor
• Computing hypermatrix spectra with the Poisson product formula
• Most Tensor Problems Are NP-Hard

This page was built for publication: The characteristic polynomial of the complete 3-uniform hypergraph