期刊文献+

完全二部图k_(4,n)去掉两条边的交叉数

The Crossing Number of the Complete Bipartite Graph by Deleting Two Edges e_1 and e_2
下载PDF
导出
摘要 用km,n表示完全二部图,用k4,n\e1,e2表示完全二部图k4,n去掉两条边e1、e2。本文确定了K4,n\e1,e2的交叉数为z(4,n)-22n+2。K4,n\e1,e2。 Let km,n denote the complete bipartite graph,and K4,n\e1,e2 denote the graph obtained from by deleting two edges e1 and e2.In this paper,we will determine the crossing number of K4,n\e1,e2 is z(4,n)-2+2.
作者 贺佩玲
出处 《衡阳师范学院学报》 2008年第6期23-25,共3页 Journal of Hengyang Normal University
基金 湖南人文科技学院青年基金资助项目(2008QN021)
关键词 完全二部图 交叉数 画法 the complete bipartite graph crossing number drawing
  • 相关文献

参考文献2

二级参考文献36

  • 1Bondy J A,Muty U S R.Graph Theory with Appplication.London:Macmillan Press,1976
  • 2Turan P.A Note of Welcome.J.Graph Theory,1977,1:7-9
  • 3Zarankiewicz K.On a Problem of P.Turan Concerning Graphs.Found.Math.,1954,41:137-145
  • 4Guy R K.The Decline and Fall of Zarankiewicz's Theorem.In:F.Harary(ed.),Proof Techniques in Graph Theory.New York:Academic Press,1969,63-69
  • 5Garey M R,Johnson D S.Crossing Number is NP-complete.SIAM J.Algebraic Discrete Methods,1983,4:312-316
  • 6Beineke 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
  • 7Klesc M.On the Crossing Number of Cartesian Products of Stars and Paths or Cycles.Math.Slovaca,1991,41:113-120
  • 8Klesc M.The Crossing Numbers of Products of Paths and Stars with 4-vertex Graphs.J.Graph Theory,1994,18:605-614
  • 9Klesc M.The Crossing Number of Certain Cartesian Products.Discuss.Math-Graph Theory,1995,15:5-10
  • 10Marian Klesc.The Crossing Numbers of Cartesian Products of Paths with 5-vertex Graphs.Discrete Mathematics,2001,233:353-359

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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