arXiv Analytics

Sign in

arXiv:1004.1778 [math.CO]AbstractReferencesReviewsResources

The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree

Xueliang Li, Yiyang Li

Published 2010-04-11Version 1

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. We show that the number of vertices of degree $j$ in $\mathcal {T}^{\Delta}_n$ is asymptotically normal with mean $(\mu_j+o(1))n$ and variance $(\sigma_j+o(1))n$, where $\mu_j$, $\sigma_j$ are some constants. As a consequence, we give estimate to the value of the general Zagreb index for almost all trees in $\mathcal {T}^{\Delta}_n$. Moreover, we obtain that the number of edges of type $(i,j)$ in $\mathcal {T}^{\Delta}_n$ also has mean $(\mu_{ij}+o(1))n$ and variance $(\sigma_{ij}+o(1))n$, where an edge of type $(i,j)$ means that the edge has one end of degree $i$ and the other of degree $j$, and $\mu_{ij}$, $\sigma_{ij}$ are some constants. Then, we give estimate to the value of the general Randi\'{c} index for almost all trees in $\mathcal {T}^{\Delta}_n$.

Comments: 13 pages
Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:1005.1135 [math.CO] (Published 2010-05-07)
The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index
arXiv:1904.09620 [math.CO] (Published 2019-04-21)
The general Zagreb index of lattice networks
arXiv:2109.11438 [math.CO] (Published 2021-09-23)
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree