Probabilistic Analysis of the First Zagreb Index

نویسندگان

  • RAMIN KAZEMI
  • Ivan Gutman
  • R. Kazemi
چکیده

In this paper we study the first Zagreb index in bucket recursive trees containing buckets with variable capacities. This model was introduced by Kazemi in 2012. We obtain the mean and variance of the first Zagreb index and introduce a martingale based on this quantity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the second order first zagreb index

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...

متن کامل

Bounds on First Reformulated Zagreb Index of Graph

The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.

متن کامل

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

Note on Properties of First Zagreb Index of Graphs

Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.

متن کامل

A note on the first Zagreb index and coindex of graphs

Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013