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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have