On stability of weighted spanning tree degree enumerators

DOI10.4213/IM9556EMaRDI QIDQ6986366zbMATH OpenFDO

Authors Pavel Prozorov, Danila Cherkashin

Publication date 12 May 2025

Published in Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4213/IM9556E

zbMATH Keywords

distance-hereditary graphsreal stable polynomialsspanning treesweighted graphs

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22) Graph polynomials (05C31) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites work

• A short survey on stable polynomials, orientations and matchings
• Distance-hereditary graphs
• Graph Classes: A Survey
• Homogeneous multivariate polynomials with the half-plane property
• Lorentzian polynomials
• Multivariate stable polynomials: theory and applications
• On stability of spanning tree degree enumerators
• Rank-width and vertex-minors

Cited in

(1)

• Around the number of trees in distance-hereditary graphs

This page was built for publication: On stability of weighted spanning tree degree enumerators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986366)