连通度,connectivity英语短句,例句大全

连通度,connectivity
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;区域高速公路网布局结构的连通度研究

英文短句/例句

1.Independence Number、Connectivity and Hamilton-connectivity;图的独立数、连通度与Hamilton连通性
2.totally disconnected metric space完全不连通度量空间
3.Restricted Edge Connectivity of de Bruijn Digraphs and Graphs;de Bruijn图的限制边连通度
4.3-Restricted Edge Connectivity and 3-Restricted Connectivity of Graphs;图的3-限制性边连通度和3-限制性连通度
5.On Super Restricted Edge Connectivity and Lower Bounds on the Edge-Connectivity of Graphs;图的超级限制边连通性和边连通度的下界
6.Research on Connectivity of Regional Road Network Based on the Capacity of Connectivity基于连通能力的区域公路网的连通度研究
7.Connectivity, Cutsets and Hamiltonian Cycles of Johnson Graphs;Johnson图的连通度、割集和哈密尔顿圈
8.Existence and Bound on k-restricted Edge Connectivity of Graphs;图的k-限制边连通度的存在性及上界
9.Optimality and Super-connectedness of Higher-order Restricted Edge Connectivity in Graphs高阶限制边连通度的最优性和超级性
10.The k-restricted Edge Connectivity of Graphs to be Optimal and Super-connectedk阶限制边连通度的最优性和超级性
11.A sharp lower bound for the algebraic connectivity of the Nordhaus-Gaddumm type图的Nordhaus-Gaddumm型的代数连通度的界(英文)
12.Furhter investigation on strong connectivity of Cayley digraphCayley有向图强连通度的进一步研究
13.The Cycles in 2-connected [4, 2]-graphs and the Fully Cycle Extensibility of Graphs with High Connectivity;2-连通[4，2]-图中的圈与高连通度图的完全圈可扩性
14.12-Degree and 13-Degree Reliable Connected Networks with the Best Connectivity具有最佳连通性的12度与13度可靠连通网络
15.The Degree Sequence of Connected Graphs and the Number of Lower Degree Vertices of Connected Plannar Graphs连通图的度序列及连通平面图的低度点个数
16.ARE ANY LR WSS CONTINUITY CODES ALSO PRESENT?有左后轮速度感知器连通码存在吗？
17.ARE ANY OF WSS CONTINUITY CODES ALSO PRESENT?是否有速度感知器连通码存在？
18.Some Properties of Wiener Index and Degree Distance of Connected Graphs;连通图的Wiener指数和度距离的若干性质

相关短句/例句

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-connectivityk-度连通