A Combinatorial Method for Computing Characteristic Polynomials of Starlike Hypergraphs

Abstract

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike hypergraphs including hyperpaths and hyperstars,which are given recursively and explicitly.

References in corpus (5)

• E-Determinants of Tensors
• New and Old Results in Resultant Theory
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
• Resultant as Determinant of Koszul Complex

Cited by in corpus (1)

• The cyclic index of adjacency tensor of generalized power hypergraphs