扩容图的大子集的可圈性

On the cyclability of the large subset in expansion graphs

目的针对完全扩容图的结构提出了任意图X的n次扩容变换图n(X)。方法首先探讨了3-次图可圈性结构与图的扩容变换之间的关系,判断多次扩容变换下图的可圈性。结果与结论得到n(X)的大子集的可圈性结果,这些结果加强了3-连通3-次图中大子集的可圈性结论。

Objective-To introduce nth complete expansion graph for any graph X with the con- struction of any expansion transformation graph 0n （X）. Methods-The relations between the constructions of cubic graph and complete expansion are investigated before judging the cyclability of nth complete expansion graph. Results and Conclusion-The cyclable results of big subset in 9n （X） are obtained, and the results are stronger than those of the 3-connected cubic graph.