For a graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Denote by Gn,k the set of graphs with n vertices and k cut edges. In this paper, we showed the types of graphs with the largest and the second largest M1 and M2 among Gn,k .

In this paper, the edge a-Zagreb indices and its coindices of some graph operations, such as generalized hierarchical product, Cartesian Product, join, composition of two graphs are obtained. Using the results obtained here, we deduce the F -indices and its coindices for the above graph operation. Finally, we have computed the edge a-Zagreb Index, F -index and their coindices of some important ...

The generalized hierarchical product of graphs was introduced by L. Barriére et al in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster product of graphs are obtained. Finally using the derived results the reformulated first Zagreb index of some chemically important graphs such as square comb latt...

Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as:     ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , )  euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.

Graph robustness or network is the ability that a graph preserves its connectivity other properties after loss of vertices and edges, which has been central problem in research complex networks. In this paper, we introduce Modified Zagreb index centrality as novel measures to study robustness. We theoretically find some relationships between these measures. Then, use analyze BA scale-free netwo...

In this article, we investigate the Zagreb index, a kind of graph-based topological several random networks, including class networks extended from recursive trees, plain-oriented and caterpillars growing in preferential attachment manner. We calculate mean variance index for each class. addition, prove that asymptotic distribution first is normal, second skewed to right.