| 扩容图的大子集的可圈性 |
| |
| 引用本文： | 斯钦,阿勇嘎. 扩容图的大子集的可圈性[J]. 宝鸡文理学院学报(自然科学版), 2013, 33(4): 1-2 |
| |
| 作者姓名： | 斯钦 阿勇嘎 |
| |
| 作者单位： | 内蒙古师范大学数学科学学院,内蒙古呼和浩特,010022;内蒙古师范大学数学科学学院,内蒙古呼和浩特,010022 |
| |
| 基金项目： | 内蒙古师大科研基金资助(No.2012ZRZD003) |
| |
| 摘 要： | 目的 针对完全扩容图的结构提出了任意图X的n次扩容变换图θn（X）.方法 首先探讨了3-次图可圈性结构与图的扩容变换之间的关系,判断多次扩容变换下图的可圈性.结果与结论得到θn（X）的大子集的可圈性结果,这些结果加强了3-连通3-次图中大子集的可圈性结论.
|
| 关 键 词： | 3-次图 n次扩容图 可圈性 |
On the cyclability of the large subset in expansion graphs |
| |
| Siqin;A Yongga. On the cyclability of the large subset in expansion graphs[J]. Journal of Baoji College of Arts and Science(Natural Science Edition), 2013, 33(4): 1-2 |
| |
| Authors: | Siqin A Yongga |
| |
| Affiliation: | Siqin;A Yongga;College of Mathematics Science,Inner Mongolia Normal University; |
| |
| Abstract: | 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. |
| |
| Keywords: | cubic graph nth expansion graph cycbility |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
