Integrity and vertex neighbor integrity of some graphs
Integrity and vertex neighbor integrity of some graphs
The integrity $I(G)$ of a noncomplete connected graph $G$ is a measure of network vulnerability and is defined by $I(G)=\min\limits_{S\subset V(G)}\{ |S|+m(G-S)\}$, where $S$ and $m(G-S)$ denote the subset of $V$ and the order of the largest component of $G-S$, respectively. The vertex neigbor integrity denoted as $VNI(G)$ is the …