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

preprint2010arXivOpen access

Abstract

Let TnΔ\mathcal {T}^Δ_n denote the set of trees of order nn, in which the degree of each vertex is bounded by some integer ΔΔ. Suppose that every tree in TnΔ\mathcal {T}^Δ_n is equally likely. We show that the number of vertices of degree jj in TnΔ\mathcal {T}^Δ_n is asymptotically normal with mean (μj+o(1))n(μ_j+o(1))n and variance (σj+o(1))n(σ_j+o(1))n, where μjμ_j, σjσ_j are some constants. As a consequence, we give estimate to the value of the general Zagreb index for almost all trees in TnΔ\mathcal {T}^Δ_n. Moreover, we obtain that the number of edges of type (i,j)(i,j) in TnΔ\mathcal {T}^Δ_n also has mean (μij+o(1))n(μ_{ij}+o(1))n and variance (σij+o(1))n(σ_{ij}+o(1))n, where an edge of type (i,j)(i,j) means that the edge has one end of degree ii and the other of degree jj, and μijμ_{ij}, σijσ_{ij} are some constants. Then, we give estimate to the value of the general Randić index for almost all trees in TnΔ\mathcal {T}^Δ_n.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.