English

On stability of spanning tree degree enumerators

Combinatorics 2023-04-10 v2

Abstract

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

Keywords

Cite

@article{arxiv.2209.04413,
  title  = {On stability of spanning tree degree enumerators},
  author = {Danila Cherkashin and Fedor Petrov and Pavel Prozorov},
  journal= {arXiv preprint arXiv:2209.04413},
  year   = {2023}
}
R2 v1 2026-06-28T01:01:50.396Z