查询词典 isolated vertex

A restricted edge-cut F of G is an edge cut such that G — F has no isolated vertex.

限制边连通度是计算机互连网络可靠性的一个重要度量。

Is said to be hyperconnected if for every minimum vertex cut C of G, G - C has exactly two components one of which is an isolated vertex.

称为超连通的，若对每个最小割集C；G-C恰有两个连通分支，且其中之一为孤立点。

Similarly, a graph X is said to be hyper-connected if every minimum vertex cut creats two components, one of which is an isolated vertex. In [8], D.Wang and J.

类似地，一个图X称为是超连通的，如果对每一个最小割集C，都有X—C只有两个连通分支，且其中一个连通分支为孤立点。

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次幂的方法，指出度数定理的实际应用。

Graf, without question, is the greatest women's player in history.

格拉芙，现在，毫无疑问是女子网坛历史上最伟大的选手。

If not, you will have to look around at all your important data.

如果没有，您将需要检查所有的重要数据。