4-连通、1-坚韧图中的控制圈

Dominating Cycles In 4-Connected 1-Tough Graphs

设G为4-连通1-坚韧的n阶非Ham ilton图,C为G的最长圈,若σ5(G)≥n+C(G)-1,则C是G的控制圈.

Let G be a 4-connected tough graphs of order n,if σ_5(G)≥n+C(G)-1,then every longest cycle in G is a dominating cycle.