Restricted edge connectivity of binary undirected kautz graphs 图的限制性边连通度
On restricted edge - connectivity of vertex - transitive graphs 点可迁图的限制边连通度
One new sufficient condition for hamilton graphs 图与连通度的一个充分条件
Distribution of the limits of algebraic connectivity of tree 树的代数连通度的极限点的分布
Analysis of an information system model of maximal connectivity with time delay constraint 一个带时延限制的最大连通度信息系统模型研究
The classical measure of the reliability is the connectivity and the edge connectivity 衡量网络可靠性的经典参数为图的连通度和边连通度。
With the background stated above , g . . gunther introduced vertex - neighbor - connectivity in 1991 Gunther于1991年引入图的邻域连通度概念, s
In the third section , we get the extremal graph of weighted graph whose connectivity is 2 在第三节中得到连通度为2的赋权图在ore型条件下的极图
In the second section of chapter three , we prove theorem 3 . 7 and a good example is given to show that the bound of locally connectivity is sharp 7的证明并且给出例子,说明该定理中的局部连通度的条件是最好可能的在53 3中,我们提出一个猜想,该猜想是由定理3gi ‘和定理3
The relationships between the tenacity and some other vulnerability paramenters of graphs , namely connectivity , toughness and integrity are established . examples show that the results are best possible 研究了图的粘连度和一些其他脆弱性参数,包括连通度、坚韧度和完整度之间的关系.实例说明所得结论是最好可能的