| 六阶图G与Sn的积图的交叉数 |
| |
| 引用本文： | 苏振华,黄元秋.六阶图G与Sn的积图的交叉数[J].数学研究,2011,44(4):411-417. |
| |
| 作者姓名： | 苏振华 黄元秋 |
| |
| 作者单位： | 1. 湖南怀化学院数学系,湖南怀化,418008
2. 湖南师范大学数学系,湖南长沙,410081 |
| |
| 基金项目： | 湖南省教育厅资助项目，国家自然科学基金资助项目 |
| |
| 摘 要： | 确定图的交叉数是NP．完全问题．目前已确定交叉数的六阶图与星图的笛卡尔积图极少。本文确定了—个六阶图G与星图5k积图的交叉数为Z（6,n）＋2n＋n/2].
|
| 关 键 词： | 交叉数 笛卡尔积图 六阶图 星图 |
The Crossing Numbers of a 6-vertex Graph G Products Sn |
| |
| Su Zhenhua Huang Yuanqiu.The Crossing Numbers of a 6-vertex Graph G Products Sn[J].Journal of Mathematical Study,2011,44(4):411-417. |
| |
| Authors: | Su Zhenhua Huang Yuanqiu |
| |
| Institution: | Su Zhenhua~1 Huang Yuanqiu~2 (l.Department of Mathematics,Hunan Huaihua University,Huaihua,Hunan,418008 2.Department of Mathematics,Hunan Normal University,Changsha,410081) |
| |
| Abstract: | Determining the crossing number of an arbitrary graph is NP-complete problem.Only a few crossing number of Cartesian products of the graph order 6 and stars had been determined. In this paper, we obtain the conclusion that cr（G × Sn） = Z（6,n）＋2n＋n/2]. |
| |
| Keywords: | Metacyclic p-groups Extraspecial p-groups Maximal subgroup |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
