Further Analysis on the Total Number of Subtrees of Trees
نویسندگان
چکیده
When considering the total number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to some other graphical indices in applications. Along this line, it is interesting to study that over some types of trees with a given order, which trees minimize or maximize this number. Here are our main results: (1) The extremal tree which minimizes the total number of subtrees among n-vertex trees with k pendants is characterized. (2) The extremal tree which maximizes (resp. minimizes) the total number of subtrees among nvertex trees with a given bipartition is characterized. (3) The extremal tree which minimizes the total number of subtrees among the set of all q-ary trees with n nonleaf vertices is identified. (4) The extremal n-vertex tree with given domination number maximizing the total number of subtrees is characterized.
منابع مشابه
The Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملUsing Stein’s Method to Show Poisson and Normal Limit Laws for Fringe Subtrees
We consider sums of functions of fringe subtrees of binary search trees and random recursive trees (of total size n). The use of Stein’s method and certain couplings allow provision of simple proofs showing that in both of these trees, the number of fringe subtrees of size k < n, where k → ∞, can be approximated by a Poisson distribution. Combining these results and another version of Stein’s m...
متن کاملThe shape of large Galton-Watson trees with possibly infinite variance
Let T be a critical or subcritical Galton-Watson family tree with possibly infinite variance. We are interested in the shape of T conditioned to have a large total number of vertices. For this purpose we study random trees whose conditional distribution given their size is the same as the respective conditional distribution of T. These random family trees have a simple probabilistic structure i...
متن کاملOn BC-trees and BC-subtrees
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the “core” of a graph, BC-trees provide an interesting class of trees. We consider questions related to BC-trees as an effort to make modest progress towards the understanding of this concept. Constructive algorithms are provided for BC-trees with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012