Further analysis on the total number of subtrees of trees

Shuchao Li, Shujing Wang

Published 2012-04-27Version 1

We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the Wiener index, and vice versa. Here are some of our results: (1) Let $\mathscr{T}_n^k$ be the set of all $n$-vertex trees with $k$ leaves, we determine the maximum (resp. minimum) value of the total number of subtrees of trees among $\mathscr{T}_n^k$ and characterize the extremal graphs. (2) Let $\mathscr{P}_n^{p,q}$ be the set of all $n$-vertex trees, each of which has a $(p,q)$-bipartition, we determine the maximum (resp. minimum) value of the total number of subtrees of trees among $\mathscr{P}_n^{p,q}$ and characterize the extremal graphs. (3) Let $\mathscr{A}_n^q$ be the set of all $q$-ary trees with $n$ non-leaf vertices, we determine the minimum value of the total number of subtrees of trees among $\mathscr{A}_n^q$ and identify the extremal graph.