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

两个5阶图与路及圈的联图的交叉数 被引量：1

The Crossing Numbers of Join of Some 5-Vertex Graphs with Paths and Cycles
在线阅读 下载PDF
导出
摘要 详细的讨论了和两个5阶图Gi(i=11,14)有关的联图的交叉数,分别是:Gi+Hn,Gi+Pn和Gi+Cn,其中Hn是由n个孤立点构成的图,Pn和Cn分别是含n个点的路和圈. In the paper, we give the crossing numbers of the ioin products Gi＋ Hn, Gi ＋ Pn and Gi＋Cn for some graphs Gi （i= 11, 14） of order five, where Hn consists on n isolated vertices, Pn and Cn are the path and cycle on n vertices, respectively.
作者 李敏
机构地区 湖北文理学院数学与计算机科学学院
出处 《河南师范大学学报（自然科学版）》 CAS 北大核心 2013年第4期40-44,共5页 Journal of Henan Normal University(Natural Science Edition)
基金 湖北省自然科学基金(2012FFC053)
关键词 图 交叉数 联图 画法 路 圈 graph crossing number join product drawing path cycle
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献9

  • 1Bondy J A, Murty U S R. Graph Theory with Applications[M]. London&The Macmillan Press,1976.
  • 2Kleitman D J. The crossing numbers of K5.n[J]. J Combin Theory, 1970,9 : 315-323.
  • 3Garey M R, Johnson S. Crossing Number is NP-complete [J]. Algebraic and Discrete Mathods, 1983,4 : 312-316.
  • 4Klesc M. The join of graphs and crossing numbers[J]. Electronic Notes in Discrte Math,2007,28:349-355.
  • 5Klesc 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.
  • 6Klesc M. The crossing numbers of join of the special graph on six vertices with path and cycle[J]. Discrete Mathe,2010,310:1475-1481.
  • 7李波,王晶,黄元秋.几个六阶图与路P_n的联图的交叉数(英文)[J].吉首大学学报（自然科学版）,2008,29(6):29-35. 被引量：4
  • 8Klesc M. The crossing numbers of Cartesian products of paths with 5-vertex graphs[J]. Discrete Math,2011,233:353-359.
  • 9Huang Yuanqiu, Zhao T. The Crossing Number of K1,4.n[J]. Discrete Math,2008,308:1634-1638.

二级参考文献10

  • 1JONATHAN L GROSS,THOMAS W TUCKER. Topological Graph Theory [ M]. John Wiley Sons, Canada: A Wiley-Interscience Publication, 1987.
  • 2HARARY F. Graph Theory [ M ]. Reading, MA : Addision-Wesley, 1969.
  • 3BONDY J A, MURTY U S R. Graph Theory with Applications [ M ]. London:The Macmillan Press LTD. , 1976.
  • 4GAREY M R, JOHNSON D S. Crossing Number is NP-complete [ J ]. SIAM J. Algebric Discrete Methods, 1993,4:312 -316.
  • 5ZARANKIEWICZ K. On a Problem of P. Turan Concerning Graphs [ J]. Fund. Math. , 1954,41 : 137 - 145.
  • 6KLEITMAN D J. The Crossing Number of K5,n[ J ]. J. Comb. Theory, 1970,9:315 - 323.
  • 7KULLI V R,MUDDEBIHAL M H. Characterization of Join Graphs with Crossing Number Zero [ J]. Far East J. Appl. Math. , 2001,5:87 - 97.
  • 8MARIAN KLESC. The Join of Graphs and Crossing Numbers [ J]. Discrete Mathematics,2007,23:349 -355.
  • 9LI Bo, WANG Jing, HUANG Yuan-qiu. On the Crossing Number of the Join of Some 5-Vertex Graphs and Pn[ J]. International J. Math. Combin. ,2008(2) :70 -77.
  • 10MEI Han-fei, HUANG Yuan-qiu. The Crossing Numbers of K1,5,n [ J]. J. International Journal of MathematicalCombinatorics, 2007( 1 ) :33 -44.

共引文献3

同被引文献13

  • 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王晶,黄元秋.S_m∨P_n与S_m∨C_n的交叉数[J].数学进展,2011,40(5):631-636. 被引量：10
  • 9郑敦勇,黄元秋.一个五点图和路的联图的交叉数[J].汕头大学学报（自然科学版）,2011,26(4):11-17. 被引量：2
  • 10苏振华,黄元秋.C_5+e与P_n、C_n的联图交叉数[J].汕头大学学报（自然科学版）,2012,27(1):24-26. 被引量：2

引证文献1

二级引证文献5

河南师范大学学报（自然科学版）
2013年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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