1) connectivity
[英][kə'nektivi,ti] [美][kə'nɛktɪvə,tɪ]
连通度
1.
A study of methods to calculate the connectivity of the bus-route network in medium-sized cities;
中等城市常规公交线网连通度计算方法
2.
Research on evaluative index of connectivity for regional road network layout planning project;
区域公路网布局规划方案的连通度评价指标研究
3.
Research on Connectivity of Layout Structure for Regional Expressway Network;
区域高速公路网布局结构的连通度研究
2) connected degree
连通度
1.
In this paper, using of graph theory and by analyzing graph s connected degree, we find a way to obtain one bound of broadcasting-time for single information.
对于网络出版传播中的广播时间问题,借助图论理论通过分析图的连通度,给出了确定网络单信息广播时间一个界的方法,实例证明该界是可以通过计算得到的。
2.
Using of graph theory to study the problem of relation for connected degree and broadcasting-time in networks, obtain a bound of broadcasting-time for single information and some sufficiency terms of minimum broadcasting-time networks, and construct an effective broadcasting scheme.
利用图论理论研究了网络连通度与广播时间的关系问题 ,获得了网络单信息广播时间的一个界和最少时间广播网的几个充分条件 ,并建立了一个有效的广播方案 。
3) edge-connectivity
边连通度
1.
Connectivity and edge-connectivity of strong product graphs;
强乘积图的连通度和边连通度(英文)
2.
The some properties of vertex-connectivity and the edge-connectivity of a~m(G)have been studied in the note.
将广义梭a(G)的定义推广到m+1个同构图的情形,定义了图a~m(G),得到广义棱a~m(G)的点连通度和边连通度的几个性质。
3.
The restricted edge-connectivity λ′ of de Bruijn digraphs D_B(d,n) was studied.
证明了对有向de B ru ijn图DB(d,n),当d≥3,n≥3或d=2,n≥3或d≥3,n=2时,它的限制边连通度λ′(DB(d,n))=2d-2。
4) 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) 。
5) Edge connectivity
边连通度
1.
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) 。
2.
We know that edge connectivity plays an importent role in the connectivity of graph.
我们知道，边连通度是反映图的连通性质的一个重要参数。
3.
For Moor-Shannon network models,the greater the k-restricted edge connectivity is,the better the reliability and fault-tolerance is.
在Moor-Shannon网络模型中,k限制边连通度较大的网络一般有较好的可靠性和容错性。
6) k-connectivity
k-度连通
补充资料：单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通超导体一般指的是不包含有非超导绝缘物质或空腔贯通的整块同质超导体，若有非超导绝缘物质或空腔贯通的超导体则称为多（复）连通超导体。从几何学上讲，在超导体外表面所包围的体积内任取一曲线回路，这回路在超导物质内可收缩到零（或点），且所取的任意回路均可收缩到零而无例外，则称单连通超导体。若有例外，即不能收缩到零，则称多连通超导体。例如空心超导圆柱体，则在围绕柱空腔周围取一回路就不能收缩为零。多连通超导体可有磁通量子化现象（见“磁通量子化”）。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条