The eccentricity of a vertex u in a connected graph G is the distance between u and a vertex farthest from it; the eccentric sequence of G is the nondecreasing sequence of the eccentricities of G. In this paper, we determine the unique tree that minimises the Wiener index, i.e. the sum of distances between all unordered vertex pairs, among all trees with a given eccentric sequence. We show that the same tree maximises the number of subtrees among all trees with a given eccentric sequence, thus providing another example of negative correlation between the number of subtrees and the Wiener index of trees. Furthermore, we provide formulas for the corresponding extreme values of these two invariants in terms of the eccentric sequence. As a corollary to our results, we determine the unique tree that minimises the edge Wiener index, the vertex-edge Wiener index, the Schulz index (or degree distance), and the Gutman index among all trees with a given eccentric sequence.
The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree 1) S with k leaves in an arbitrary tree with sufficiently large number of leaves is called the inducibility of S. Its precise value is known only for some specific families of trees, most of them exhibiting a symmetrical configuration. In an attempt to answer a recent question posed by Czabarka, Székely, and the second author of this article, we provide bounds for the inducibility J(A5) of the 5-leaf binary tree A5 whose branches are a single leaf and the complete binary tree of height 2. It was indicated before that J(A5) appears to be 'close' to 1/4. We can make this precise by showing that 0.24707 . . . ≤ J(A5) ≤ 0.24745 . . .. Furthermore, we also consider the problem of determining the inducibility of the tree Q4, which is the only tree among 4-leaf topological trees for which the inducibility is unknown.
A vertex whose removal in a graph G increases the number of components of G is called a cut vertex. For all n, c, we determine the maximum number of connected induced subgraphs in a connected graph with order n and c cut vertices, and also characterise those graphs attaining the bound. Moreover, we show that the cycle has the smallest number of connected induced subgraphs among all cut vertex-free connected graphs. The general case c > 0 remains an open task. We also characterise the extremal graph structures given both order and number of pendant vertices, and establish the corresponding formulas for the number of connected induced subgraphs. The 'minimal' graph in this case is a tree, thus coincides with the structure that was given by Li and Wang [Further analysis on the total number of subtrees of trees.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.