说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。
您的位置：首页 -> 词典 -> 2-强连通
1)  2-strong connected
2-强连通
2)  strongly 2-order neighbor connected
强2-阶邻域连通
3)  2-connected
2-连通
1.
Hamilton problem of 2-connected claw-free graphs;
2-连通无爪图的Hamilton性
2.
In this paper,we show that 2-connected T3-confined gragh G contains a Hamiltonian cycle if GF′.
本文主要证明:如果GF′,2-连通T3-受限图G含有Hamilton图。
更多例句>>
4)  2-connected graph
2-连通图
1.
Let G=(V;E) be a 2-connected graph of order n and k a positive integer, we consider the problem of partitioning G into k vertexdisjoint paths under the neighborhood union condition and them obtain the new following results: If ｜N_G(x_1)∪N_G(x_2)｜+｜N_G(y_1)∪N_G(y_2)｜n-k for every four independent vertices, then G can be partitioned into k vertex-disjoint paths.
给定一个阶为n的2-连通图G=(V;E)及一个正整数k,考虑在邻域并条件下G被分成k条点不交路的问题,得到下面的结果,对G中任何四个独立点x1,x2,y1,y2∈V,满足|NG(x1)∪NG(x2)|+|NG(y1)∪NG(y2)|n-k,则G能被分划分k条点不交的路。
2.
Any 2-connected graph on n vertices such that the degree sum of any two vertices at distance 2 is at least λ—1 contains a cycle of length at least λ.
若G是2-连通图,如对G中任何两个距离为2的点υ,ν都有d(υ)+d(ν)≥λ-1(5≤λ≤|V(G)|),则除了两类图外,G的最长圈的长至少为λ。
5)  2-vertex connected
2-点连通
6)  2-connected graphs
2连通图
补充资料：强上
强上 强上 　　证名。指颈项肌肉拘急而呈上仰状。《素问·脉解篇》：“强上引背者，阳气大上而争，故强上也。”多见于痉病、高热。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条