Alpay Kirlangic, Department of Mathematics, Science Faculty, Ege University-35100, Bornova-Izmir, Turkey, e-mail: kirlan@bornova.ege.edu.tr
Abstract: 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$, $\NI(G)$, is defined to be $\NI(G) = \min_{S\subseteq V(G)} \{|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.
Keywords: vulnerability, integrity, neighbor-integrity
Classification (MSC 2000): 05C40, 05C85
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
