Abstract
Let denote the set of trees of order , in which the degree of each vertex is bounded by some integer . Suppose that every tree in is equally likely. We show that the number of vertices of degree in is asymptotically normal with mean and variance , where , are some constants. As a consequence, we give estimate to the value of the general Zagreb index for almost all trees in . Moreover, we obtain that the number of edges of type in also has mean and variance , where an edge of type means that the edge has one end of degree and the other of degree , and , are some constants. Then, we give estimate to the value of the general Randić index for almost all trees in .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.