edge connectivity

edge connectivity的基本解释

-

边连通度

与edge connectivity相关的网络例句 [注：此内容来源于网络，仅供参考]

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

Comparing the landscape types of 1995 with that of 2005, we find out that:①the natural arbors are decreasing, with patches more fragmentation, size more odds, shapes more complex;②the area of natural shrubberies is increasing, with patches less fragmentation, shapes more simple and formulary ,the size of patches more even;③the area of natural grasses is increasing, with patches less fragmentation, shapes of patches more odds;④the area of timbers is increasing, with patches more dominance in landscape, more connectivity;⑤the area of Eucalyptus increases, with patches less fragmentation, shapes of patches more complex , more convergence, more connectivity;⑥the area of orchards is increasing, more connectivity;⑦the patches of the rubber is becoming more assemble, more connectivity, more formulary;⑧the area of plowland increases;⑨the area of reservoirs, rivers and ponds increases, with patches more assemble;⑩the area of cities decreases, with patches more dispersing, with shape more complexthe area of countries increases, with patches less connectivity, more dispersing, with shape more complex; the patches of the rest lands are more dispersing, with shape more complex;(3)In the process of economic development in the upper reaches of the Changhuajiang river watershed, a series of the ecological environment problems have appeared because a lot of landscape function broke off, and the connection of human landscape with natural landscape decreased, which aroused by the fragmentation of natural and semi-nature landscapes increased, the stability of the landscape structure decreased, as well as stress of human disturbance, resource and environment upon the landscape increased gradually.

3昌化江上游流域在经济发展进程中，自然与半自然景观破碎度增加，自然景观结构稳定性下降，人为干扰、资源和环境对景观胁迫逐渐增大，中断了许多生态过程，导致城市等人文景观与自然景观连接度很差，产生了一系列的生态环境问题。

与edge connectivity相关的网络解释 [注：此内容来源于网络，仅供参考]

edge connectivity：边连通度

edge 边 | edge connectivity 边连通度 | edge homomorphism 边缘同态

edge connectivity：邊連接性

邊緣著色 edge coloring | 邊連接性 edge connectivity | 邊緣連接器 edge connector

Edge and Vertex Connectivity：割边/割点

Eulerian Cycle / Chinese Postman Euler回路/中国邮路 | Edge and Vertex Connectivity 割边/割点 | Network Flow 网络流

Edge and Vertex Connectivity：割边/割点 zfD无忧研修网

Eulerian Cycle / Chinese Postman Euler回路/中国邮路 zfD无忧研修网 | Edge and Vertex Connectivity 割边/割点 zfD无忧研修网 | Network Flow 网络流 zfD无忧研修网