Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 11 Apr 2010 in math.CO and cs.DM | (1004.1778v1)

Abstract: 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$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.