Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 11 Apr 2010 in math.CO and cs.DM

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

We haven't generated a summary for this paper yet.