期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

K_(2,3)∨C_n的交叉数 被引量：6

On the crossing numbers of K_(2,3)∨C_n
下载PDF
导出
摘要 将完全二部图K_(2,3)的每个顶点与C_n每个点相连,得到的图记为K_(2,3)∨C_n.利用一些完全多部图的交叉数结论,将K_(2,3)∨C_n与K_(2,3,n)比较,证明了K_(2,3)∨C_n的交叉数为Z(5,n)+n+3. By connecting the vertices of K_（2,3） to the vertices of C_n,a join graph denoted by K_（2,3）∨C_n was obtained.By utilizing some results of the crossing number of complete multipartite graphs and comparing K_（2,3）∨C_n to K_（2,3,n）,we proved that the crossing number of K_（2,3）∨C_n is Z（5,n） ＋ n ＋ 3.
作者 袁秀华
机构地区 南京林业大学数学系
出处 《华东师范大学学报（自然科学版）》 CAS CSCD 北大核心 2011年第5期21-24,共4页 Journal of East China Normal University(Natural Science)
关键词 联图 画法 交叉数 join graph drawing crossing number
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献9

  • 1BONDY J A, MURTY U S i%. Graph Theory with Applications[M]. New York: Macmilan Ltd Press, 1976.
  • 2CAREY M R, Johnson D J. Crossing number is NP-complete [J]. Slam J Alg Disc Methods, 1983(4): 312-316.
  • 3KLEITMAN D J. The crossing number of Ks,n[J]. J Combin Theory, 1971, 9: 315-323.
  • 4WOODALL D R. Cyclic-order graphs and Zarankiewicz's crossing number conjecture[J]. J Graph Theory, 1993, 17(6): 657-671.
  • 5OPOROWSKI B, ZHAO D. Coloring graphs with crossings[J]. Discrete Mathematics, doi;10,1016/j.disc, 2008.07.040.
  • 6TANG L, WANG J, HUANG Y Q. The crossing number of the join of Cn and Pn[J]. International J Math Com, 2007(11): 110-116.
  • 7PAK Tung Ho. On the crossing number of some complete multipartite graph [J]. Utilitas Mathematica, 2009, 79: 154-143.
  • 8PAK Tung Ho. The crossing number of K2,2,2,n [J]. Far East Journal of Applied Mathematics, 2008, 30(1): 43-69.
  • 9ASANO K. The crossing number of K1,3,n and K2,3,n[J]. J Graph Theory, 1986(10): 1-8.

同被引文献47

  • 1Bondy J A, Murty U S R. Graph theory with application[M]. New York: Macmillan London and Elsevier, 1979.
  • 2Garey M R, Johnson D S. Crossing number is NP-complete[J]. SIAM J Alg Disc Meth, 1983, 4(3): 312-316.
  • 3Kleitman D J. The crosing number of K5,n[J] J Graph Series B, 1970, 9: 3154323.
  • 4Asano K. The crossing number of K1,3,n and K2,3,n[J]. J Graph Theory, 1986, 10: 1-8.
  • 5Yang Yuansheng, Lin Xiaohui. The crossing number of C(n; { 1, 3})[J]. Discrete Mathematics, 2004, 289: 107-118.
  • 6Klesc M. The join of graphs and crossing numbers [J]. Electronic Notes in Discrete Math, 2007, 28: 349-355.
  • 7Tang Ling, Wang Jing, Huang Yuanqiu. The crossing number of the join of Cm and pn[j]. International Journal of Mathematical Combinatorics, 2007, 1: 110-116.
  • 8Klesc M. The crossing numbers of join of the special graph on six vertices with path and cycle [J]. Discrete Mathematics, 2010, 310: 1475-1481.
  • 9Klesc M. The crossing numbers of join products of path with graphs of order four [J]. Discussiones Mathematicae Gragh Theory, 2011, 31: 321-331.
  • 10J A Bondy, U S R Murty. Graph theory with application[M]. Macmillan London and Elsevier, New York, 1979.

引证文献6

二级引证文献4

华东师范大学学报（自然科学版）
2011年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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