A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes
2000
Discrete Mathematics
A set of vertices S is subverted from a graph G by removing the closed neighborhood N [S] from G. We denote the survival subgraph of the vertex subversion strategy S by G=S. The vertex-neighbor-integrity of G is deÿned to be VNI is the order of the largest connected component in the graph H . The graph parameter VNI was introduced by Cozzens and Wu [3] to measure the vulnerability of a spy network. Cozzens and Wu showed that the VNI of paths, cycles, trees and powers of paths on n vertices are
doi:10.1016/s0012-365x(99)00352-0
fatcat:fa5fteyig5c6je5hxcxw62g4x4