Vertex neighbor-integrity of sequential joined graphs
Mai An-chan · Basic Sciences Journal of Textile Universities · 2005
A vertex subversion strategy of a graph G is a vertex set S of V(G) whose closed neighborhood is deleted from G.The survival subgraph is denoted by G/S.The vertex-neighbor-integrity of G is (defined) to be VNI(G)=(min)SV(G){|S+m(G/S)},where S is any vertex subversion strategy of G and m(G/S) is the maximum order of the component of G/S.In this paper,the properties of vertex-neighbor-integrity of sequential-joined graphs are discussed.