期刊文献+

K_(2,3)∨P_n的交叉数 被引量:2

Crossing number of K_(2,3)∨P_n
下载PDF
导出
摘要 已经确定的五阶图与路P_n的联图的交叉数较少,作者继续深化这方面的研究,得到了联图K_(2,3)∨P_n与{K_(2,3)+e}∨P_n的交叉数为Z(5,n)+n+1. Few results are known on vertices with paths. The research in this the crossing numbers of join product for graphs having five aspect is deepened, and it is determined that the crossing number of K2,3 ∨ Pn and {K2,3 + e} V Pn is Z(5, n) + n + 1.
出处 《高校应用数学学报(A辑)》 CSCD 北大核心 2012年第4期488-492,共5页 Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金 湖南省教育厅资助项目(11C0981)
关键词 交叉数 联图 完全二部图 crossing number join graph complete bipartite graph paths
  • 相关文献

参考文献11

  • 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.
  • 10袁秀华.K_(2,3)∨C_n的交叉数[J].华东师范大学学报(自然科学版),2011(5):21-24. 被引量:6

二级参考文献28

  • 1Bondy, J.A., Murty, U.S.R., Graph Theory With Application, London, 1976.
  • 2Turan, P., A note of welcome, J. Graph Theory, 1977, 1: 7-9.
  • 3Garey, M.R., Johnson, D.S., Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods, 1983, 4: 312-316.
  • 4Kleitman, D.J., The crossing number of K5,n, J. Combinatorics Theory, 1971, 9: 315-323.
  • 5Klesc, M., On the crossing number of Cartesian products of stars anti paths or cycles, J. Math. Slovaca, 1991, 41: 113-120.
  • 6Klesc, M., The crossing numbers of products of paths and stars with 4*vertex graphs, J. Graph Theory, 1994, 18: 605-614.
  • 7Klesc, M., The crossing number of certain Cartesian products, Discuss. Math-Graph Theory, 1995, 15: 5-10.
  • 8Klesc, M., The crossing numbers of Cartesian products of paths with 5-vertex graphs, Discrete Mathematics, 2001, 233: 353-359.
  • 9Beineke, L.W., Ringeisen, R.D., On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory, 1980, 4: 145-155.
  • 10Wang Jing, Huang Yuanqiu, The crossing number of K2,4* Pn, Acta Mathematica Scientia(in Chinese), 5008, 28A: 251-255.

共引文献11

同被引文献19

  • 1BONDY J A, MURTY U S R. Graph Theory with Applications[M]. London: The Macmillan Press LTD.,1976.
  • 2GAREY M R, JOHNSON D S. Crossing number is NP-complete [J]. SIAM J. Algebraic and Discrete Mathods, 1983(4): 312-316.
  • 3KLESC M, SCHROTTER S. The crossing numbers of join products of paths with graphs of order four[J]. Discuss. Math.-Graph Theory, 2011(31): 321-331.
  • 4KLESC M. The crossing numbers of Cartesian products of paths with 5-vertex graphs[J]. Discrete Math, 2001(233): 353-359.
  • 5KLEITMAN D J. The crossing numbers of K [J]. J. Combin. Theory, 1970(9): 15-323.
  • 6Bondy J A,Murty U S R. Graph theory with application[M].New York:Elsevier,1979.
  • 7Garey M R,Johnson D S. Crossing number is NP-complete[J].SIAM J Alg Disc Meth,1983,(03):312-316.
  • 8Kleitman D J. The crosing number of K5,n[J].J Graph Ser B,1970.315-323.
  • 9Huang Y Q,Zhao T L. The crossing number of K1,4,n[J].Discrete Mathmatics,2008,(09):1634-1638.
  • 10Klesc M. The join of graphs and crossing numbers[J].Electronic Notes in Discrete Math,2007.349-355.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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