The multiplicative Zagreb indices of graph operations

Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem. 64:359-372, 2010) have proposed the multiplicative variants of ordinary Zagreb indices, which are defined as follows: Pi(1) = Pi(1)(G) = Pi(v is an element of V(G)) d(G)(V)(2), Pi(2) = Pi(2)(G) = Pi(uv is an element of E(G)) d(G)(u)d(G)(V). These two graph invariants are called multiplicative Zagreb indices by Gutman (Bull. Soc. Math. Banja Luka 18:17-23, 2011). In this paper the upper bounds on the multiplicative Zagreb indices of the join, Cartesian product, corona product, composition and disjunction of graphs are derived and the indices are evaluated for some well-known graphs. MSC: 05C05, 05C90, 05C07.Selçuk Üniversites

On the Harary index of graph operations

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, expressions for the Harary indices of the join, corona product, Cartesian product, composition and disjunction of graphs are derived and the indices for some well-known graphs are evaluated. In derivations some terms appear which are similar to the Harary index and we name them the second and third Harary index.Selçuk Üniversitesi 13701071National Natural Science Foundation of China (NSFC) 1120122