On stability of spanning tree degree enumerators
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2022
- DOI:
- 10.48550/arXiv.2209.04413
- arXiv:
- arXiv:2209.04413
- Bibcode:
- 2022arXiv220904413C
- Keywords:
-
- Mathematics - Combinatorics