Edge-vertex degree based Zagreb index and graph operations

A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge $e=xy$, $ev$-dominates not only the vertices incident to it but also those adjacent to either $x$ or $y$. The edge-vertex degree of $e,$ $de{g}_G^{ev}(e),$ is the number of vertices in the $ev$-dominating set of $e$. In this article, we compute expressions for the $ev$-degree version of the Zagreb index of several unary and binary graph operations.