Tree of Vertex Neighbor-Integrity Equal to 1,2
Wuang Gai-mei · Dalian Minzu Xueyuan xuebao · 2007
Let G be a graph.A vertex subversion strategy of G,S is a set of vertices in G whose closed neighborhood is deleted from G.The survival subgraph is denoted by G/S.The vertex-neighbor-integrity of G,VNI(G)=minsV(G){|S|+ω(G/S)},where S is any vertex subversion strategy of G,and is maximum order of the components of G/S.In this paper,the tree of vertex neighbor-integrity with 1,2 are been characterized.