connected graph

常見(jiàn)例句

G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一個(gè)圖是超級(jí)限制邊連通的，如果它的任一極小限制邊割都孤立一條有最小邊度的邊。
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.
用代數(shù)方法給出了一個(gè)關(guān)於連通圖頂點(diǎn)度數(shù)的不等式，竝給出了連通圖擬拉普拉斯矩陣的最大特征值的幾個(gè)上界。
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-連通圖最長(zhǎng)路和最長(zhǎng)圈上5度點(diǎn)的分佈情況，刻畫(huà)收縮臨界5-連通圖的結(jié)搆。