扩容图的大子集的可圈性  

On the cyclability of the large subset in expansion graphs

作　　者：斯钦[1] 阿勇嘎[1] 

机构地区：[1]内蒙古师范大学数学科学学院,内蒙古呼和浩特010022

出　　处：《宝鸡文理学院学报（自然科学版）》2013年第4期1-2,共2页Journal of Baoji University of Arts and Sciences(Natural Science Edition)

基　　金：内蒙古师大科研基金资助(No.2012ZRZD003)

摘　　要：目的针对完全扩容图的结构提出了任意图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.

关 键 词：3-次图 n次扩容图 可圈性 

分 类 号：O157.5[理学—数学]