删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

联图S5Cn的交叉数

本站小编 Free考研考试/2021-12-27

联图S5Cn的交叉数 李阳, 黄元秋湖南师范大学数学与计算机科学学院, 长沙 410081 On the Crossing Numbers of Join of S5Cn LI Yang, HUANG YuanqiuMathematics and Computer Science College, Hunan Normal University, Changsha 410081
摘要
图/表
参考文献(0)
相关文章(15)
点击分布统计
下载分布统计
-->

全文: PDF(354 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)
摘要两个图GH的联图,记作GH,是指将G中每个点与H中的每个点连边得到的图.本文证明了星图S5与圈Cn的联图S5Cn的交叉数为Z(6,n)+4?n/2?+3(n≥3),其中Z(m,n)=?m/2??m-1/2??n/2??n-1/2?, m,n为非负整数.
服务
加入引用管理器
E-mail Alert
RSS
收稿日期: 2014-09-09
PACS:O157.5
基金资助:国家自然科学基金(11371133,11301169)资助项目.
引用本文:
李阳, 黄元秋. 联图S5Cn的交叉数[J]. 应用数学学报, 2016, 39(2): 173-183. LI Yang, HUANG Yuanqiu. On the Crossing Numbers of Join of S5Cn. Acta Mathematicae Applicatae Sinica, 2016, 39(2): 173-183.
链接本文:
http://123.57.41.99/jweb_yysxxb/CN/ http://123.57.41.99/jweb_yysxxb/CN/Y2016/V39/I2/173


[1] Bondy J A. Graph Theory With Applications. London: Macmilan, 1976
[2] Garey M R, Johnson D S. Crossing number is NP-complete. Algebric Discrete Methods, 1993, 4: 312-316
[3] Kleš? M. The Crossing Numbers of K2,3×Pn and K2,3×Sn. Tatra. Moutains Math. Publ., 1996, 1: 51-56
[4] Kleš? M. On the crossing number of Cartesian products of stars and paths or cycles. Math. Slovaca, 1991, 41: 113-120
[5] Beineke L W, Ringeisen R D. On the crossing number of products of cycles and graphs of order four. Graph Theory, 1980, 4: 145-155
[6] Kleš? M. The crossing number of Cartesian products of paths with 5-vertex graphs. Discrete Mathematics, 2001, 233: 353-359
[7] Kleš? M. The crossing number of the Cartesian products of Wm with Pn. Mathematical Research, 2009, 29: 362-366
[8] (文献的中文) (Wang J, Huang Y Q. The crossing number of K2,4×Pn. Acta Mathematica Scientia, 2008, 28A: 251-255)
[9] Ho P T. On the crossing number of some complete multipartite graphs. Utilitas Mathematica, 2009, 79: 143-154
[10] Mei H F, Huang Y Q. The crossing number of K1,5,n. International Math. Com., 2007, 1: 33-44
[11] Kleitman D The crossing number of K5,n. Combinatorial Theory, 1971, 9: 315-323
[12] Zarankiewicz K. On a Problem of P. Turan Concerning Graphs. Fund. Math., 1954, 41: 137-145
[13] Guy R K. The decline and fall of ZaranKiewicz's theorem. New York: Academic Press, 1969, 63-69
[14] Oporowski B, Zhao D. Coloring graphs with crossing. Discrete Mathematics, 2009, 309: 2948-2951
[15] Tang L, Wang J, Huang Y Q. The crossing number of the join of Cn and Pn. International Math. Com., 2007, 11: 110-116
[16] Kleš? M. The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Math., 2010, 310: 1475-1481
[17] 王晶, 黄元秋. Sm ∨ Pn与 Sm ∨ Cn的交叉数. 数学进展, 2011, 10: 631-636 (Wang Jing, Huang Yuanqiu. The crossings numbers of Sm ∨ Pn and Sm ∨ Cn, Advances in Mathematics, 2011, 10: 631-636)

[1]原军, 刘爱霞. 局部内(外)半完全有向图可迹的充分条件[J]. 应用数学学报, 2016, 39(2): 200-212.
[2]孙林, 孙德荣. 1-可嵌入曲面的图的边染色[J]. 应用数学学报, 2016, 39(1): 12-20.
[3]崔丽楠, 郭巧萍. 几乎正则多部竞赛图中弧的外路[J]. 应用数学学报, 2016, 39(1): 130-137.
[4]欧阳章东, 黄元秋. 关于K2,2,2Sn的交叉数[J]. 应用数学学报, 2015, 38(6): 968-975.
[5]刘勇飞, 王建锋, 冶成福. 第二大特征值在(1,2)的单圈图的刻画[J]. 应用数学学报, 2015, 38(4): 610-618.
[6]陈祥恩, 郭虹园, 王治文. mC4的顶点被多重色集合可区别的一般边染色[J]. 应用数学学报, 2015, 38(3): 406-412.
[7]王长远, 曹海涛. 完全图的最大(最小)几乎可分解的(4,2)-圈填充(覆盖)[J]. 应用数学学报, 2015, 38(1): 183-192.
[8]李艳艳. k-强连通竞赛图外弧4泛圈点的研究[J]. 应用数学学报(英文版), 2014, 37(5): 891-894.
[9]蔡建生. 不含带弦7-圈的平面图的全染色[J]. 应用数学学报(英文版), 2014, 37(2): 286-296.
[10]袁梓瀚, 黄元秋, 刘金旺. 循环图C(9,2)与路Pn的笛卡尔积的交叉数[J]. 应用数学学报(英文版), 2013, 36(2): 350-362.
[11]赵凌琪, 冯伟, 徐春雷, 吉日木图. 无圈超图规模的进一步研究[J]. 应用数学学报(英文版), 2012, 35(5): 913-917.
[12]马刚, 马少仙, 张忠辅. 一些联图的均匀全染色[J]. 应用数学学报(英文版), 2010, 33(4): 624-631.
[13]王丽娜, 熊黎明. 闭无爪图在圈闭包运算下哈密尔顿指数的稳定性[J]. 应用数学学报(英文版), 2010, 33(3): 424-431.
[14]刘新求, 黄元秋, 王晶. 多重圈梯图在射影平面上的嵌入个数[J]. 应用数学学报(英文版), 2010, 33(2): 317-327.
[15]梁志和. 完全图循环分解成2-正则图[J]. 应用数学学报(英文版), 2008, 31(6): 1137-1141.



PDF全文下载地址:

http://123.57.41.99/jweb_yysxxb/CN/article/downloadArticleFile.do?attachType=PDF&id=14141
相关话题/应用数学 数学 统计 学报 湖南师范大学