On stability of spanning tree degree enumerators

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.

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2023-12, Vol.346 (12), p.113629, Article 113629
Main Authors: Cherkashin, Danila, Petrov, Fedor, Prozorov, Pavel
Format: Article
Language:English
Subjects:
Cayley formula
Distance-hereditary graphs
Real stable polynomials
Spanning trees
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0012-365X
DOI:10.1016/j.disc.2023.113629