期刊文献+

笛卡尔积c(7,2)\{e_1,e_2}×P_n的交叉数

The Crossing Number of c(7,2)\{e_1,e_2}×P_n
下载PDF
导出
摘要 已经确定了7阶循环图c(7,2)与Pn的笛卡尔积交叉数.确定了的七个顶点的图与路、星和圈的笛卡尔积的交叉数为数不多.本文确定了c(7,2)去掉两条边后与Pn的笛卡尔积的交叉数为5n 1. There are several known results on the crossing numbers of the Carstesian products of c(7,2) with paths,cycles and stars.In this paper we extend these results,and show that the crossing numbers of the Carstesian product of c(7,2)/{e1,e2}×Pn with Pn is 5 n 1.
出处 《湖南理工学院学报(自然科学版)》 CAS 2012年第1期16-19,共4页 Journal of Hunan Institute of Science and Technology(Natural Sciences)
基金 湖南省教育厅项目(11CO541)
关键词 交叉数 c(7 2) 笛卡尔积 同胚 crossing number c(7 2) Carstesian product homeomorphism path
  • 相关文献

参考文献2

二级参考文献22

  • 1周智勇,肖文兵,黄元秋.星图S_5及5个六阶图与路的笛卡儿积图的交叉数[J].湖南文理学院学报(自然科学版),2007,19(1):1-4. 被引量:5
  • 2周智勇,黄元秋.笛卡尔积图K_(3,3)×P_n的交叉数[J].湖南师范大学自然科学学报,2007,30(1):31-34. 被引量:7
  • 3Bondy J A,Murty U S R.Graph Theory with Application[M].New York:Elsevier,1976.
  • 4Garey M R,Johnson D S.Crossing number is NP-complete[J].SlAM J Algeb Discrete Math,1983,4:312-316.
  • 5Zheng Wenping,Lin Xiaohui,Yang Yuansheng,et al.On the crossing number of Km×Pn[J].Graphs Combin,2007,23:327-336.
  • 6Richter R B,Salazar G.The crossing number of C6×Cn[J].Austral J Combin,2001,23:135-143.
  • 7Zheng Wenping,Lin Xiaohui,Yang Yuansheng,et al.On the crossing numbers of Km× Cn and K(m,l)×Pn[J].Discrete Appl Math,2008,156:1892-1907.
  • 8Yang Yuansheng,Lin Xiaohui,Lu Jianguo,et al.The crossing number of C(n; {1,3})[J].Discrete Math,2004,289:107-118.
  • 9Bondy, J.A., Muty, U.S.R., Graph Theory With Application, M. London, 1976.
  • 10Zarankiewicz, k., On a problem of P.Turan concerning graphs, J. Found.Math., 1954, 41: 137-145.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部