The subtrees of a tree have been studied from various points of view. In particular, the extremal trees that maximize the number of subtrees were identified for different categories of trees such as binary trees and trees with a given maximum degree. We extend these results to trees with given degree sequences. Furthermore, an ordering of the extremal trees with different degree sequence is provided. This ordering provides a relatively easy way to identify extremal trees. Some of the previously know results follow as corollaries
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
Problems in two areas of graph theory will be considered. First, I will consider extremal problems f...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
When considering the number of subtrees of trees, the extremal structures which maximize this number...
This article investigates some properties of the number of subtrees of a tree with given degree sequ...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between an...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
This thesis consists of research on two topics.The first topic is about different middle parts of tr...
As an effort to show something that may be of broad interest, yet not to repeat what I have done in ...
We discovered a dual behavior of two tree indices, the Wiener index and the number of subtrees, for ...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
Problems in two areas of graph theory will be considered. First, I will consider extremal problems f...
The subtrees of a tree have been studied from various points of view. In particular, the extremal tr...
When considering the number of subtrees of trees, the extremal structures which maximize this number...
This article investigates some properties of the number of subtrees of a tree with given degree sequ...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between an...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D...
This thesis consists of research on two topics.The first topic is about different middle parts of tr...
As an effort to show something that may be of broad interest, yet not to repeat what I have done in ...
We discovered a dual behavior of two tree indices, the Wiener index and the number of subtrees, for ...
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtr...
AbstractVarious topological indices have been put forward in different studies, from biochemistry to...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
Problems in two areas of graph theory will be considered. First, I will consider extremal problems f...