Abstract
Let denote the set of trees of order , in which the degree of each vertex is bounded by some integer . Suppose that every tree in is equally likely. For any given subtree , we show that the number of occurrences of in trees of is with mean and variance , where , are some constants. As an application, we estimate the value of the Estrada index for almost all trees in , and give an explanation in theory to the approximate linear correlation between and the first Zagreb index obtained by quantitative analysis.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.