Schultz and Zagreb Indices in Corona of two Graphs

Abstract

The \({corona}\) of two graphs \(G\) and \(H\), written as \(G \odot H\), is defined as the graph obtained by taking one copy of \(G\) and \(|V(G)|\) copies of \(H\), and joining by an edge the \(i\)th vertex of \(G\) to every vertex in the \(i\)th copy of \(H\). In this paper, we present the explicit formulae of the (modified) Schultz and Zagreb indices in the corona of two graphs.