连通度

k阶限制边连通度的最优性和超级性

The k-restricted Edge Connectivity of Graphs to be Optimal and Super-connected

关于k阶限制边连通度若干问题的研究

The Research of k-restricted Edge Connectivity of Graphs

边连通度问题的三维DNA图结构解法

Three dimensional DNA graph structure solution to edge-connectivity

连通度是adhoc网络的根本属性。

Connectivity is one of the essential properties of Ad Hoc networks .

adhoc网络保持连通度的临界传输范围的研究

Study of Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks

基于连通度的adhoc网络路由协议研究与仿真

Study and Simulation of Connectivity Based on Routing Protocols in Ad hoc Networks

证明了n维立方形递归网络是一类连通度为n的n正则网络；

We prove ^ - dimension cubelike recursive networks are a kind of n regular network those connectivity is n.

一种基于连通度选择的改进P2P资源搜索算法

Improved P2P Resource Search Algorithm Based on Connectivity Choice

通过计算机仿真模拟试验，给出了网络的k（k>0）连通度概率分布曲线；

By computer simulations , the probability distribution graph of k-vertex-connectivity ( k > 0 ) is given .

首先建立了多总线系统三种容错性指标（总线容错度Tb、处理机容错度Tp、混合容钳度T（bp））与相应的二元图连通度的关系。

Some results are presented which related fault-tolerance degrees of a multibus system with the connectivity of the bipartite graph induced by the system .

图的连通度与模linkage

Graph Connectivity and Modulo Linkage

有关Hamilton图与连通度的一个充分条件本文主要从三方面来研究地震动沿深度变化的特性，即幅值、频谱和持时。

One new sufficient condition for hamilton graphs 1 . The amplitude aspect .

证明了当n≥4时，双向双环局域网的限制连通度为4，其限制性容错直径为n。

It is also shown that , when n ≥ 4 , the restricted connectivity of the network is 4 and its restricted fault diameter is n .

Euler环游图的连通度

Connectivity of Euler Tour Graphs

设G是一个图.G的最小度，连通度，控制数，独立控制数和独立数分别用δ，κ，γ，i和α表示。

Let δ,κ,γ, I and α be the minimum degree , the connectivity , the domination number , the independent domination number and the independence number of a graph G , respectively .

本文在引进机构学两个重要概念&活动度（Mobility）和连通度（Connectivity）的基础上，推导出机器人手部机构必须满足的两个条件。

Onthe basis of two fundamental conceptions & mobility and connectivity of the mechanism , we get two conditions which must be satisfied by a robot hand-mechanism .

后半部分，本论文研究了直积图的连通度及边连通度问题，给出了G×K2的点连通度。

The latter part deals with the connectivity and edge connectivity of direct products . The connectivity of G × K2 has been given .

本文对Q（mnm（n-1）Lm1）和Qn（m）在限制故障集合条件下的连通度与容错直径进行了讨论和计算。

In this issue the connectivity and fault diameter of Q ( m_n m_ ( n-1 ) Λ m_1 ) andQ_n ( m ) is computed .

然后证明了n维HCH-立方体互连网络的最小顶点度数和顶点连通度和边连通度为n，保持了超立方体和交叉立方体的最高连通度的优点；

Then it is proved that the smallest vertex degree , vertex connectivity and link connectivity are all n , which is holding the best connectivity the same as the hypercube and the crossed cube .

QQ用户网络连通度分布的统计结果显示QQ用户节点所处的网络兼有两种类型网络的特点。

The statistic on the connectivity degree of QQ user nodes indicates that the network has characteristics of two kinds of networks .

邻接树图的连通度（英文）关于Kobayashi微分度量的连续性

Connectivity of ( Adjacency ) Tree Graphs On Continuity of the Kobayashi Differential Matric

采用基于节点连通度的簇划分算法对CMR协议进行改进，改进后的算法选择连通度高的节点优先成为簇首，这样选举出的簇首更利于簇的管理与维护。

A new clustering algorithm which based on max-connectivity is proposed to improve the bad clustering of CMR .

无向Kautz图的限制性连通度和限制性容错直径

Restricted Connectivity and Restricted Fault Diameter of Undirected Kautz Graphs

仿真结果表明，PD算法成簇数目少于最高连通度算法（HD），而且簇内节点无重叠，从而有效降低了分簇结构的维护开销。

The simulation results show that the number of clusters of PD is less than that of highest connectivity degree algorithm ( HD ), without overlapping nodes so that maintenance cost is effectively decreased .

给出了K1，r-free图中点独立数与其它参数如点数，边数，坚韧度，连通度等之间的一些关系。

Some relations between the independence number and other parameters such as the order , the size , degree sequence and the toughness in K 1 , r free graphs are given .

目前对K-Neigh算法的研究主要集中在K值的大小对连通度的影响，尚缺乏该算法在改善网络性能方面的性能评估。

The current research for the K-Neigh algorithm focuses on the effect of the K value on connection degree , and hence lacks the performance evaluation of the algorithm on improving network performance .

基于连通度的拓扑分析法及其探测策略研究

Topological analysis based on connection and strategy research in robot exploration

可迁图的超常边连通度的最优性

Optimization properties of extra - edge - connectivity for Transitive Graphs

关于图的超常边连通度和等周边连通度的等值性

On Equivalence of Isoperimetric Edge Connectivity and Extra Edge Connectivity of Graphs

区域高速公路网布局结构的连通度研究

Research on Connectivity of Layout Structure for Regional Expressway Network