Advanced Search

Let $G$ be a graph. A vertex subversion strategy of $G$, say $S$, is a set of vertices in $G$ whose closed neighborhood is removed from $G$. The survival-subgraph is denoted by $G/S$. The Neighbor-Integrity of $G$, $\mathrm{N}I\left(G\right)$, is defined to be $\mathrm{N}I\left(G\right)={min}_{S\subseteq V\left(G\right)}\left\{\right|S|+c(G/S)\}$, where $S$ is any vertex subversion strategy of $G$, and $c(G/S)$ is the maximum order of the components of $G/S$. In this paper we give some results connecting the neighbor-integrity and binary graph operations.