The multiplicity of the zero Laplacian eigenvalue of uniform hypertrees
Abstract
In this paper, the Laplacian characteristic polynomial of uniform hypergraphs with cut vertices or pendant edges and the Laplacian matching polynomial of uniform hypergraphs are characterized.The multiplicity of the zero Laplacian eigenvalue of uniform hypertrees is given, which proves the conjecture in zheng2023zero (The zero eigenvalue of the Laplacian tensor of a uniform hypergraph, Linear and Multilinear Algebra, (2023) Doi:10.1080/03081087.2023.2172541).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.