“…For a graph G, the degree of a vertex u is the number of edges incident to u, denoted by δG(u). The complement of G, denoted by G , is a simple graph on the same set of vertices V (G) in which two vertices u and v are adjacent, i.e., connected by an edge uv, if and only if they are not adjacent in G. ) − m, the degree of a vertex u in G, is the number of edges incident to u, denoted by δ G (u) = n − 1 − δG(u), [5], [6]. Then, M. Khalifeh et al [3] and K. Kiruthika [7] computed the first and second Zagreb indices of Cartesian product G1 × G2, composition G1 • G2, disjunction G1 ∨ G2, symmetric difference G1 ⊕ G2, join G1 + G2, tensor product G1 ⊗ G2, and strong product G1 * G2 of two graphs.…”