1) neighbor connectivity
邻域连通度
1.
In this paper,we study the relationship between the edge neighbor connectivityλ_(NB) of agraph G and the(vertex) neighbor connectivityκ_(NB) of its line graph L(G),and prove thatλ_(NB)(G)≤κ_(NB)(L(G)).
研究了图G的边邻域连通度λ_(NB)(G)和它的线图L(G)的点邻域连通度κ_(NB)(L(G))之间的关系,证明了λ_(NB)(G)≤κ_(NB)(G)。
2) vertex(edge)neighbor-connectivity
点(边)邻域连通度
3) edge neighbor connectivity
边邻域连通度
1.
In this paper,we study the relationship between the edge neighbor connectivityλ_(NB) of agraph G and the(vertex) neighbor connectivityκ_(NB) of its line graph L(G),and prove thatλ_(NB)(G)≤κ_(NB)(L(G)).
研究了图G的边邻域连通度λ_(NB)(G)和它的线图L(G)的点邻域连通度κ_(NB)(L(G))之间的关系,证明了λ_(NB)(G)≤κ_(NB)(G)。
2.
The number of edges in a minimum edge cut strategy is defined to be the edge neighbor connectivity.
G的最小割边策略所含的边数为边邻域连通度。
4) restricted edge neighbor connectivity
限制性边邻域连通度
1.
We also propose a new concept of restricted edge neighbor connectivityλ_(NB)~τ(G),and provethatκ_(NB)(L(G))≤λ_(NB)~τ(G).
提出了一个新的概念:限制性边邻域连通度λ_(NB)~r(G),证明了κ_(NB)(L(G))≤λ_(NB)~r(G)。
5) minimal connected neighborhood graph
最小连通邻域图
1.
ISOMAP based on minimal connected neighborhood graph;
基于最小连通邻域图的ISOMAP算法
6) strongly 2-order neighbor connected
强2-阶邻域连通
补充资料：邻域
邻域
neighbourhood
邻域【.吨仙仪们.闭;0冲ec，Oc、}，拓扑空间中点x(集合A)的 该空间中含有点x(集合A)的任何开集.有时，该拓扑空间中任何集合，如果其内部含有点x(集合A)，也称为点x(集合A)的邻域(亦见集合的内部(interiorofaset)). B.A.nacHHK.撰胡师度、白苏华译
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条