| 几个六阶图与路的笛卡尔积的交叉数 |
| |
| 引用本文： | 吕胜祥,黄元秋.几个六阶图与路的笛卡尔积的交叉数[J].湖南文理学院学报(自然科学版),2007,19(2):30-35,48. |
| |
| 作者姓名： | 吕胜祥 黄元秋 |
| |
| 作者单位： | 湖南师范大学,数学与计算机科学学院,湖南,长沙,410081;湖南师范大学,数学与计算机科学学院,湖南,长沙,410081 |
| |
| 基金项目： | 湖南省教育厅重点课题(05A037) |
| |
| 摘 要： | 计算图的交叉数问题被证明是NP-完全问题,能确定具体交叉数的图类也比较少.证明了几个六阶图与路Pn的笛卡尔积的交叉数.
|
| 关 键 词： | 交叉数 路 笛卡儿积 |
| 文章编号： | 1672-6146（2007）02-0030-06 |
| 修稿时间： | 2006-09-15 |
On the Crossing Numbers of Products of Paths with 6-vertex Graphs |
| |
| LV Sheng-xiang,HUANG Yuan-qiu.On the Crossing Numbers of Products of Paths with 6-vertex Graphs[J].Journal of Hunan University of Arts and Science:Natural Science Edition,2007,19(2):30-35,48. |
| |
| Authors: | LV Sheng-xiang HUANG Yuan-qiu |
| |
| Institution: | Department of Mathematics, Human Normal University, Changsha Hunan 410081 |
| |
| Abstract: | Computing the crossing number of a given graph is NP-complete,the crossing number of only a few families of graphs are known .In this paper we determine the crossing numbers of Cartesian products of graphs on six vertices with paths. |
| |
| Keywords: | Crossing number Path Cartesian products |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
