On the roots of the subtree polynomial

DOI10.1016/j.ejc.2020.103181zbMath1447.05111arXiv1810.08655OpenAlexW3038980724MaRDI QIDQ2198997

Jason I. Brown, L. A. S. Mól

Publication date: 15 September 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.08655

zbMATH Keywords

subtree roots

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31)

Related Items (2)

The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Models of random subtrees of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• Indistinguishable trees and graphs
• The minimal number of subtrees of a tree
• The minimal number of subtrees with a given degree sequence
• On the roots of edge cover polynomials of graphs
• Alternating Whitney sums and matchings in trees. II
• Monotonicity of the mean order of subtrees
• Enumeration of subtrees of trees
• The average order of a subtree of a tree
• Alternating Whitney sums and matchings in trees. 1
• On the average number of nodes in a subtree of a tree
• On the roots of domination polynomials
• On the roots of all-terminal reliability polynomials
• On the distribution of subtree orders of a tree
• On the Local and Global Means of Subtree Orders
• On the roots of the node reliability polynomial
• A Course in Mathematical Analysis
• Maximizing the mean subtree order
• The Number of Subtrees of Trees with Given Degree Sequence

This page was built for publication: On the roots of the subtree polynomial