Mathematics – Combinatorics
Scientific paper
2010-05-07
Mathematics
Combinatorics
12 pages
Scientific paper
Let $\mathcal {T}^{\Delta}_n$ denote the set of trees of order $n$, in which the degree of each vertex is bounded by some integer $\Delta$. Suppose that every tree in $\mathcal {T}^{\Delta}_n$ is equally likely. For any given subtree $H$, we show that the number of occurrences of $H$ in trees of $\mathcal {T}^{\Delta}_n$ is with mean $(\mu_H+o(1))n$ and variance $(\sigma_H+o(1))n$, where $\mu_H$, $\sigma_H$ are some constants. As an application, we estimate the value of the Estrada index $EE$ for almost all trees in $\mathcal {T}^{\Delta}_n$, and give an explanation in theory to the approximate linear correlation between $EE$ and the first Zagreb index obtained by quantitative analysis.
Li Xueliang
Li Yiyang
No associations
LandOfFree
The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index 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 The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-222094