1) longest path(cycle)
最长路(圈)
2) the longest cycle
最长圈
1.
The construction of geodetic graphs containing the longest cycle C10 is studied.
给出包含最长圈子是C10的测地图中,C10和它上的割线构成图的结构形式。
2.
The main work of this paper is on the longest cycle in connected claw-free graphs in order to know more about the construction of connected claw-free graphs.
图的最长圈是探讨图的Hamilton性的重要工具之一,对它们的研究具有重要的理论价值和应用价值。
3) the minimum length of the circle
最小圈长
4) Noncontract cycle
最长面圈
5) longest cycles
最长圈
1.
The length of the longest cycles in 2-connected K_(1,3)-free graphs is studied with the conception of spoke number ξ(G) of a graph G,it is proved that when G is a 2-connected K_(1,3)-free graphs with the condition ξ(G)<1/2λ(G),then C(G)≥2/3(n+6).
讨论了一类2-连通无爪图的最长圈,若G是2-连通的无爪图,C是G的最长圈,G的阶为n,并且ξ(G)<1/2λ(G),则C(G)≥2/3(n+6)。
2.
The length of the longest cycles in 2 connected K 1,3 free graphs is studied.
讨论了２－连通无爪图中的最长圈，得到了：当Ｇ是一个非Ｈａｍｉｌｔｏｎ的２－连通的无爪图，且ξ（Ｇ）≥１２λ（Ｇ）时，则ｃ（Ｇ）≥２ξ（Ｇ）＋４。
6) X-longest cycle
X-最长圈
补充资料：长路
1.远路。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条