期刊文献+

W_m∨P_n的交叉数 被引量:3

The Crossing Number of W_m∨P_n
下载PDF
导出
摘要 在Klesc M给出的联图W_3 V P_n的交叉数的基础上,继续对联图W_m V P_n(m=4,5)的交叉数cr进行了研究,得到了cr(W_3 V P_n)=Z(5,n)+n+「n/2+1」以及cr(W_5 V P_n)=Z(6,n)+n+3[n/2」+1,n≥2. Based on the crossing numbers of join products of W3 with Pn by Klesc M,We studies the crossing numbers of the join graph Wm∨Pn(m = 4,5),and gets the exact value of cr(W4∨Pn) = Z(5,n) + n+[n/2]+ 1 and cr(W5∨Pn) = Z(6,n) + n + 3[n/2]+1 for n≥2.
出处 《数学研究》 CSCD 2012年第3期310-314,共5页 Journal of Mathematical Study
基金 湖南省教育厅资助项目(11C0981) 怀化学院青年基金项目(HHUY2012-07)
关键词 交叉数 联图 轮图 画法 Crossing number Join graph Wheel Drawing
  • 相关文献

参考文献11

  • 1Bondy J A, Murty U S R. Graph theory with application. New York: Elsevier, 1976.
  • 2Garey M R, Johnson D S. Crossing number is NP-complete. SIAM ,I. Algebraic Dis- crete Methods, 4(3)(1983): 312-316.
  • 3Kleitman D J. The crosing number of Ks,n. J.Graph Series B, 9(1970): 315-323.
  • 4Huang Y Q, Zhao T L. The crossing number of K1,4,n. Disc.Math, 308(9)(2008): 1634- 1638.
  • 5Mei Hanfei, Huang Yuanqiu. The crossing number of Kl,5,n. International Journal of Mathematical combinatorics, 1(2007): 33-44.
  • 6贺佩玲,黄元秋.W_4×S_n的交叉数[J].郑州大学学报(理学版),2007,39(4):14-18. 被引量:6
  • 7马祖强,蔡俊亮.W_5×S_n的交叉数[J].应用数学学报,2008,31(4):615-623. 被引量:9
  • 8Klesc M. The join of graphs and crossing numbers. Electronic Notes in Discrete Math, 28(2007): 349-355.
  • 9Klesc, M. The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Mathematics, 310(2010): 1475-1481.
  • 10王晶,黄元秋.S_m∨P_n与S_m∨C_n的交叉数[J].数学进展,2011,40(5):631-636. 被引量:10

二级参考文献45

  • 1Bondy J A, Murty U S R. Graph Theory with Applications. London: Macmillan Press, 1976.
  • 2Douglas B.West, Introduction to Graph Theory(Second Edition). Prentice Hall,2001.
  • 3Kleitman D J. The Crossing Number of K5,n. J.combinatorial Theoru (Series B), 1970, 9:315-325.
  • 4Mei Hanfei, Huang Yuanqiu. The Crossing Number of K1,5,n. International J. Math Combin., 2007, (1): 33-44
  • 5Zhao Lin, He Weili, Liu Yanpei, Ren Xiang. The Crossing Number of Two Cartesian Products. International J. Math. Combin., 2007, (1): 120-127.
  • 6Marian Klesc. The Crossing Numbers of Products of Path and Stars with 4-Vertex Graphs. J. Graph Theory, 1994, 18:605-614.
  • 7Marian Klesc. The Crossing Numbers of K2,3 × Pn and K2,3 × Sn. Tatra Mt. Math. Pub., 1996, 9:51-56.
  • 8Marian Klesc. The Crossing Numbers of Cartesian Products of Path with 5-Vertex Graphs. Discrete Mathematics, 2001, 233:353-359.
  • 9Marian Klesc. On the Crossing Numbers of Products of Stars with Graphs of Order Five. Graphs and Combinatorics, 2001, 17:289-294.
  • 10Marian Klesc. The Join of Graphs and Crossing Numbers. Electronic Note in Discrete Math., 2007, 28:394-355.

共引文献20

同被引文献23

  • 1Bondy J A,Murty U S R. Graph theory with application[M].New York:Elsevier,1979.
  • 2Garey M R,Johnson D S. Crossing number is NP-complete[J].SIAM J Alg Disc Meth,1983,(03):312-316.
  • 3Kleitman D J. The crosing number of K5,n[J].J Graph Ser B,1970.315-323.
  • 4Huang Y Q,Zhao T L. The crossing number of K1,4,n[J].Discrete Mathmatics,2008,(09):1634-1638.
  • 5Klesc M. The join of graphs and crossing numbers[J].Electronic Notes in Discrete Math,2007.349-355.
  • 6Klesc M. The crossing numbers of join of the special graph on six vertices with path and cycle[J].DISCRETE MATHEMATICS,2010.1475-1481.
  • 7钱春华.五阶图与星图的笛卡尔积图的交叉数[D]长沙:湖南师范大学,2007.
  • 8贺佩玲,黄元秋.W_4×S_n的交叉数[J].郑州大学学报(理学版),2007,39(4):14-18. 被引量:6
  • 9Bondy J A, Murty US R. Graph theory with applications[M]. New York: Macmillan London and Elsevier, 1976.
  • 10Garey M R, Johnson D S. Crossing number is NP-complete[J]. SIAM J. Algebraic Discrete Methods, 1983, 4(3): 312-316.

引证文献3

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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