The asymptotic values of the general Zagreb and Randi\'c indices of trees with bounded maximum degree

Abstract

Let Tn denote the set of trees of order n, in which the degree of each vertex is bounded by some integer . Suppose that every tree in Tn is equally likely. We show that the number of vertices of degree j in Tn is asymptotically normal with mean (μj+o(1))n and variance (σj+o(1))n, where μ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. Moreover, we obtain that the number of edges of type (i,j) in Tn also has mean (μij+o(1))n and variance (σ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 μij, σij are some constants. Then, we give estimate to the value of the general Randi\'c index for almost all trees in Tn.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…