On stability of spanning tree degree enumerators

DOI10.1016/J.DISC.2023.113629MaRDI QIDQ6056722zbMATH OpenOpenAlexFDO

Authors Danila Cherkashin, F. V. Petrov, Pavel Prozorov

Publication date 4 October 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

Cayley formuladistance-hereditary graphsreal stable polynomialsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph polynomials (05C31) Connectivity (05C40)

Abstract: We show that the spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial if and only if $G$ is distance-hereditary.

Cites work

• A short survey on stable polynomials, orientations and matchings
• Distance-hereditary graphs
• Graph Classes: A Survey
• Homogeneous multivariate polynomials with the half-plane property
• Multivariate stable polynomials: theory and applications
• Newton polytopes in algebraic combinatorics

Cited in

(2)

• Around the number of trees in distance-hereditary graphs
• On stability of weighted spanning tree degree enumerators

This page was built for publication: On stability of spanning tree degree enumerators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056722)