点邻域完整度等于1,2的树

Tree of Vertex Neighbor-Integrity Equal to 1,2

设G是图,G的点颠覆策略S是G的一个点子集,它的闭邻域从G中删去,幸存子图记为G/S.G的点邻域完整度VNI(G)定义为:VNI(G)=mins V(G){|S|+ω(G/S)},S是G的任意的点颠覆策略,ω(G/S)是G/S的最大连通分支的阶.刻画了点邻域完整度为1,2的树.

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） = min { ｜ S ｜ ＋ ω（G/S） }, where S is any vertex subversion strategy of G, and is maximum order of the compo =mins lohtain in V（G） nents of G/S. In this paper, the tree of vertex neighbor-integrity with 1,2 are been eharaeterized.