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

DOI10.1016/j.disc.2024.113915arXiv2306.16247OpenAlexW4391629159WikidataQ128317548 ScholiaQ128317548MaRDI QIDQ6204332

Li Su, Shaun M. Fallat, Hong-Hai Li

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.16247

zbMATH Keywords

characteristic polynomialresultantmatching polynomialtensorshypertreechip-firing game

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Hypergraphs (05C65) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of uniform hypergraphs
• Chip-firing games on graphs
• Chip-firing and the critical group of a graph
• Problems in algebraic combinatorics
• On the sandpile group of dual graphs
• On the adjacency spectra of hypertrees
• Hypergraph theory. An introduction
• The matching polynomials and spectral radii of uniform supertrees
• A Harary-Sachs theorem for hypergraphs
• The characteristic polynomial of the complete 3-uniform hypergraph
• A combinatorial method for computing characteristic polynomials of starlike hypergraphs
• A reduction formula for the characteristic polynomial of hypergraph with pendant edges
• A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
• The spectra of uniform hypertrees
• Eigenvalues of a real supersymmetric tensor
• HYPERGRAPHS
• Using Algebraic Geometry
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• Ideals, Varieties, and Algorithms
• Tensor Analysis

This page was built for publication: On a relationship between the characteristic and matching polynomials of a uniform hypertree