| 引用本文： |
-
唐干武,唐高华,王敏.关于边数q ≥ Cp-12-2的(p,q)图的泛圈性研究[J].广西科学,2007,14(3):206-208. [点击复制]
- TANG Gan-wu,TANG Gao-hua,WANG Min.On Pancyclic of (p, q)-Graphs with Size q ≥ Cp-12-2[J].Guangxi Sciences,2007,14(3):206-208. [点击复制]
|
|
| |
|
|
| 本文已被：浏览 313次 下载 252次 |
码上扫一扫！ |
| 关于边数q ≥ Cp-12-2的(p,q)图的泛圈性研究 |
|
唐干武1, 唐高华2, 王敏3
|
|
|
| (1.桂林师范高等专科学校数学与计算机科学系, 广西桂林 541001;2.广西师范学院数学与计算机科学系, 广西南宁 530001;3.烟台大学数学与信息科学系, 山东烟台 264005) |
|
| 摘要: |
| 应用图包装的理论和方法研究n(n ≥ 5)阶(p,q)图的泛圈性,得到当q ≥ Cp-12-2时是泛圈图的充要条件是:(1)G不为C2,8,C3,8,C4,9,K2∨(K1+K2,2),K1+K2,4;(2)G不为C1,n,C3,7,C2,7,C2,6,C2,5,2K3,K2+K3,K1+K2,3和C4+K1及其支撑子图. |
| 关键词: 泛圈图 Hamilton图 嵌入 包装 |
| DOI： |
| 投稿时间：2006-12-18修订日期：2007-03-20 |
| 基金项目: |
|
| On Pancyclic of (p, q)-Graphs with Size q ≥ Cp-12-2 |
|
TANG Gan-wu1, TANG Gao-hua2, WANG Min3
|
| (1.Department of Mathematics and Computer Science, Guilin Teachers College, Guilin, Guangxi, 541001, China;2.Department of Mathematics and Computer Science, Guangxi Teachers College, Nanning, Guangxi, 530001, China;3.Department of Mathematics and Information Science, Yantai University, Yantai, Shandong, 264005, China) |
| Abstract: |
| The pancyclic of the n (n ≥ 5)-order (p, q)-graphs is discussed by using the method and theory of graph packing.The sufficient and necessary condition for the pancyclic graphs with n (n ≥ 5)-order (p, q)-graphs at size q ≥ Cp-12-2 is obtained as follows: (1)the pancyclic graphs are not the graphs of C2, 8, C3, 8, C4, 9, K2∨ (K1+K2, 2), K1+K2, 4; (2)the pancyclic graphs are not the graphs of C1, n, C3, 7, C2, 7, C2, 6, C2, 5, 2K3, K2+K3, K1+K2, 3, C4+K1 and their spanning subgraphs are obtained. |
| Key words: pancyclic Hamilton graph embedding packing |
|
|
|
|
|
