The edge corona of two graphs G and H, denoted by G 0 H, is obtained by taking one copy of G and |E(G)| copies of H and joining each end vertices of i-th edge of G to every vertex in the i-th copy of H. In this paper, the Hyper Zagreb index of edge corona of two graphs is presented. Also, the vertex Padmakar Ivan (vertex-PI) and the Szeged indices of edge corona of two trees are computed. Moreover, the upper bounds on the multiplicative Zagreb indices and the multiplicative sum Zagreb index of edge corona of two graphs are obtained. As applications, we use these results to compute the Hyper Zagreb index, the vertex-PI index and the Szeged index of certain classes of graphs.

Keywords