connected graph

常见例句

G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
An inequality about degree of vertex of a connected graph can be given, and the upper bounds of the largest eigenvalue of the quasi-Laplacian matrix of a connected graph can be obtained.
用代数方法给出了一个关于连通图顶点度数的不等式，并给出了连通图拟拉普拉斯矩阵的最大特征值的几个上界。
In this paper we discuss the distribution of vertices of degree 5 on the longest path and cycle and thus give a characterization of contraction critical 5-connected graph in a certain aspect.
讨论收缩临界5-连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5-连通图的结构。