期刊文献+

联图S5∨Cn的交叉数

On the Crossing Numbers of Join of S_5 ∨ C_n
原文传递
导出
摘要 两个图G和H的联图,记作G∨H,是指将G中每个点与H中的每个点连边得到的图.本文证明了星图S_5与圈C_n的联图S_5∨C_n的交叉数为Z(6,n)+4[n/2]+3(n≥3),其中Z(m,n)=[m/2][(m-1)/2][n/2][(n-1)/2],m,n为非负整数. By connecting each vertex of a graph G to each vertex of a graph H, join graph, denoted by G V H, is obtained. In this paper, we have proved that the crossing number of S5 V Cn is Z(6, n) + 4[n/2] + 3, where Z(m, n) =[m/2,[m-1/2][n/2][n-1/2]and both m and n are nonnegative integers.
作者 李阳 黄元秋
出处 《应用数学学报》 CSCD 北大核心 2016年第2期173-183,共11页 Acta Mathematicae Applicatae Sinica
基金 国家自然科学基金(11371133,11301169)资助项目
关键词 画法 交叉数 联图 drawing crossing number join graph cycle
  • 相关文献

参考文献2

二级参考文献29

  • 1GROSS J L, TUCKER T W. Topological Graph Theory [M]. John Wiley & Sons, Inc., New York, 1987.
  • 2HAFLARY F. Graph Theory [M]. Addieon-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif-London, 1969.
  • 3KLESC M. The crossing numbers of products of paths and stars with 4-vertex graphs [J]. J. Graph Theory, 1994, 18(6): 605--614.
  • 4KLESC M. The crossing numbers of certain Cartesian products [J]. Discuss. Math. Graph Theory, 1995, 15(1): 5-10.
  • 5KLESC M. The crossing number of K2,3 × Pn and K2,3 × St, [J]. Tatra Mt. Math. Publ., 1996, 9: 51-56.
  • 6KLESC M. The crossing number of K5 × Pn [J]. Tatra Mt. Math. Publ., 1999, 18: 63--68.
  • 7KLESC M. The crossing numbers of Cartesian products of paths with 5-vertex graphs [J]. Discrete Math., 2001, 233(1-3): 353-359.
  • 8KLESC M. On the crossing numbers of Cartesian products of stars and paths or cycles [J]. Math. Slovaca, 1991, 41(2): 113-120.
  • 9YU Ping, HUANG Yuanqiu. The crossing numbers of Pm × Wn [J]. J. Nat. Sci. Human Norm. Univ., 2005, 28(1): 14-16. (in Chinese)
  • 10BOKAL D. On the crossing numbers of Cartesian products with paths [J]. J. C, ombin. Theory Ser. B, 2007, 97(3): 381-384.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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