1) 2-vertex connected
2-点连通
2) 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 GF′.
本文主要证明:如果GF′,2-连通T3-受限图G含有Hamilton图。
3) 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的最长圈的长至少为λ。
4) 2-connected graphs
2连通图
5) 2-strong connected
2-强连通
6) vertex connectivity
点连通度
1.
G is a simple graph with a(G) and k(G) , its algebraic and vertex connectivity.
a(G),k(G)分别为G的代数连通度和点连通度,该文刻画了满足a(G)=k(G)的图。
2.
Let G be a connected graph of order n whose algebraic connectivity, vertex connectivity, and edge connectivity are α(G), κ(G), and λ(G), respectively.
n阶连通图G的代数连通度、点连通度和边连通度分别记作α(G) ,κ(G)和λ(G) 。
补充资料：单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通超导体一般指的是不包含有非超导绝缘物质或空腔贯通的整块同质超导体，若有非超导绝缘物质或空腔贯通的超导体则称为多（复）连通超导体。从几何学上讲，在超导体外表面所包围的体积内任取一曲线回路，这回路在超导物质内可收缩到零（或点），且所取的任意回路均可收缩到零而无例外，则称单连通超导体。若有例外，即不能收缩到零，则称多连通超导体。例如空心超导圆柱体，则在围绕柱空腔周围取一回路就不能收缩为零。多连通超导体可有磁通量子化现象（见“磁通量子化”）。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条