中文摘要：

设G是图，G的点颠覆策略S是G的一个点子集，它的闭邻域从G中删去，幸存子图记为G／S．G的点邻域完整度VNI（G）定义为：VNI（G）=minS整包含于V（G）{｜S｜＋ω（G／S）}，S是G的任意的点颠覆策略，ω（G／S）是G／S的最大连通分支的阶．G的边颠覆策略T是G边子集，它的闭邻域（边及其两个端点）从G中删去，幸存子图记为G／T，G的边邻域完整度ENI（G）定义为：ENI（G）=minT整包含于E（G）{｜T｜＋ω（G／T）），T是任意的边颠覆策略，ω（G／T）是G／T的最大的分支阶数．本文刻画点回边邻域完整度为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-integri- ty of G,VNI（G）= minS lohtain in V（G） {｜S｜ ＋ω（G/S） }, where S is any vertex subversion strategy of G, and to（G/S） is maximum order of the components of G/S. An edge subversion strategy of G, T is a set of edges in G whose closed neighborhood（edge with nodes） is deleted from G. The survival subgraph is denoted by G/ T. The edge-neighbor-integrity of G, ENI（G）= min T lohtain in E（G）{｜T｜ ＋ω（G/T）}, where T is any edge subversion strategy of G, and to（G/T） is maximum order of the components of G/T. In this paper, the graph of vertex neighbor-integrity and edge neighbor-integrity with 1,2 have been characterized.