边连通度

And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.

证明了一类r-正则r=κ′连通非完全图G的边坚韧度近似等于r/21+(1/│V│-1并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式。

Moreover, the smallest degree sum on potentially K(p,1,1)-graphic sequences and k-cycle-graphic sequences are given respectively; bounds on m-restricted edge connectively and 3,4-restricted edge cut of graphs are also characterized respectively.

此外，还分别给出了蕴含k圈和（p，1，1）-部图可图序列度和的下界；分别给出连通图含m-限制边割的充分条件和必要条件及连通度的界。

It is shown that the natural connectivity can be derived mathematically from the graph spectrum as an average eigenvalue and that it changes strictly monotonically with the addition or deletion of edges.

自然连通度可以直接从网络邻接矩阵的特征谱导出，在数学形式上表示为一种特殊形式的平均特征根，并且随着加边或删边严格单调变化。

The restricted edge connectivity is an important measure of fault-tolerance for interconnection networks.

一个图是超级限制边连通的，如果它的任一最小限制边割都孤立一条有最小边度的边。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

Utilizequadratic form and Perron value of bottleneck matrices, we study how the algebraic connectivityof a weighted tree changes under shifting its branches and changing its edge s weights and obtainmore entire information about algebrai.

利用代数连通度的二次型形式和瓶颈矩阵的Perron值，我们研究了当迁移或改变分支和变动一些边的权重时树的代数连通度的变化，得到了比过去更多的关于赋权树的代数连通度的结论。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。