On stability of the spanning trees enumerator

We show that the spanning trees 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:arXiv.org 2022-09
Main Authors: Cherkashin, Danila, Petrov, Fedor, Prozorov, Pavel
Format: Article
Language:English
Subjects:
Graph theory
Polynomials
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that the spanning trees enumerator polynomial of a connected graph \(G\) is a real stable polynomial if and only if \(G\) is distance-hereditary.
ISSN:2331-8422