1) vertex(edge)-neighbor-integrity
点(边)邻域完整度
2) edge-neighbor-integrity
边邻域完整度
1.
Research on the edge-neighbor-integrity of a graph;
关于图的边邻域完整度若干问题的研究
2.
By use of the edge-neighbor-integrity of graph G, this paper discusses the bound of the neighbor-integrity of line graph( L(G).
利用图的边邻域完整度,讨论了其线图的邻域完整度的界,得到了以下主要结果:①设β(G)为图G的边独 立数,则VNI(L(G))≤β(G);②对于任意连通图G,有VNI(L(G))≥ENI(G)-1,且此下界可达到。
3) vertex neighbor-integrity
点邻域完整度
1.
In this paper,the tree of vertex neighbor-integrity with 1,2 are been characterized.
G的点邻域完整度VNI(G)定义为:VNI(G)=mins V(G){|S|+ω(G/S)},S是G的任意的点颠覆策略,ω(G/S)是G/S的最大连通分支的阶。
2.
Graph of vertex neighbor-integrity and edge vertex neighbor-integrity with 1,2;
G的点邻域完整度VNI(G)定义为:VNI(G)=minS V(G){|S|+ω(G/S)},S是G的任意的点颠覆策略,ω(G/S)是G/S的最大连通分支的阶。
4) vertex-neighbor-integrity
邻域完整度
1.
It was proved by Gambrell that the decision prob- lem of computing the vertex-neighbor-integrity of a graph is NP-complete.
记幸存子图为G/X,G的邻域完整度定义为VNI(G)=min(|X|+r(G/X)},其中τ(G/X)表示G/X的最大连通分支所含顶点数。
2.
By using the quadratic integer programming method,the problem about the maximal edge number of a graph with a fixed vertex-neighbor-integrity is studied.
本文用二次整数规划法研究给定邻域完整度的图可能具有的最大边数问题。
3.
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.
讨论了顺次联图邻域完整度的一些性质。
5) vertex(edge)neighbor-connectivity
点(边)邻域连通度
6) neighbor-integrity set
邻域完整集
补充资料：边域
1.犹边地。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条