connected graph
基本解釋
- [數(shù)] 連接圖，[數(shù)] 連通圖
英漢例句
- 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é)搆。
雙語(yǔ)例句
詞組短語(yǔ)
- connected simple graph 連通簡(jiǎn)單圖
- connected planar graph 連通平麪圖
- connected noncrossing graph 連通不交圖
- connected reduced graph 連通簡(jiǎn)化圖
- connected -graph model 連接圖模型
短語(yǔ)
專(zhuān)業(yè)釋義
- 連通圖
- 連接圖
- 連通圖
In this part. G is 3-connected graph, e is an edge of 3-connected graph, if G — e is a subdivisionof 3-conneeted graph, then r is called an rmuwablr edge of (.
若G-e是3連通圖的一個(gè)剖分,則稱(chēng)e是3連通圖的可去邊。 - 連接圖
- 連通圖
- 連通子圖
- 相連圖脈