On the Spectra of Threshold Hypergraphs
Abstract
Starting with an isolated vertex, here we construct a threshold hypergraph by repeatedly adding an isolated vertex or a k-dominating vertex set. We represent a threshold hypergraph by a string of non-negative integers and find the Laplacian spectrum of threshold hypergraphs from their string representation. We also compute the complete Laplacian spectrum of certain threshold hypergraphs from the Ferrer's diagram of their degree sequences. We show that the Laplacian spectra of threshold hypergraphs are r-integral, i.e., integral multiple of r, for some r∈ Q. We also construct another class of hypergraphs whose Laplacian spectra are r-integral.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.