Author/Authors :
Kazemi, Ramin Department of Statistics - Imam Khomeini International University, Qazvin, I. R. Iran , Behtoei, Ali Department of Pure Mathematics - Imam Khomeini International University, Qazvin, I. R. Iran , Kohansal, Akram Department of Statistics - Imam Khomeini International University, Qazvin, I. R. Iran
Abstract :
Bucket recursive trees are an interesting and natural generalization of recursive trees. In this model the nodes are buckets that can hold up to b>= 1 labels. The (modified) Zagreb index of a graph is defined as the sum of the squares of the outdegrees of all vertices in the graph. We give the mean and variance of this index in random bucket recursive trees. Also, two limiting results on this index are given.
