Enumeration of subtrees of trees

Details Enumeration of subtrees of trees Enumeration of subtrees of trees

2006-09-17

arxiv.org/abs/math/0609475v1

Mathematics

Combinatorics

20 pages, 11 figures

Scientific paper

10.1016/j.tcs.2006.09.002

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we characterize the tree with the diameter at least $d$, which has the maximum number of subtrees, and we characterize the tree with the maximum degree at least $\Delta$, which has the minimum number of subtrees.

Affiliated with

Also associated with

No associations

Rating

Enumeration of subtrees of trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of subtrees of trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of subtrees of trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704806