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

(Sm∪K1)+Dn的交叉数

本站小编 Free考研考试/2021-12-27
(Sm∪K1)+Dn的交叉数 苏振华1,2, 黄元秋11. 湖南师范大学数学与统计学院, 长沙 410081;
2. 怀化学院数学与计算科学学院, 怀化 418008 The Crossing Numbers of (Sm∪K1)+Dn SU Zhenhua1,2, HUANG Yuanqiu11. College of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China;
2. School of Mathematics and Computing Sciences, Huaihua University, Huaihua 418008, China
摘要
图/表
参考文献
相关文章(8)
点击分布统计
下载分布统计
-->

全文: PDF(312 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)
摘要Sm∪K1是由星图Sm与孤立点K1构成的不连通图.本文首先确定了当m=1，2，3时，（Sm∪K1）+Dn的交叉数，再在猜想cr（K6，n+1\e）=Z（6，n+1）-2[n/2]成立时，得到了（S4∪K1）+Dn的交叉数.
服务
加入引用管理器
E-mail Alert
RSS
收稿日期: 2020-07-14
PACS:05C10
05C38
基金资助:湖南省自然科学基金（2017JJ3251）资助项目.

引用本文:
苏振华, 黄元秋. (Sm∪K1)+Dn的交叉数[J]. 应用数学学报, 2021, 44(2): 197-208. SU Zhenhua, HUANG Yuanqiu. The Crossing Numbers of (Sm∪K1)+Dn. Acta Mathematicae Applicatae Sinica, 2021, 44(2): 197-208.
链接本文:
http://123.57.41.99/jweb_yysxxb/CN/或 http://123.57.41.99/jweb_yysxxb/CN/Y2021/V44/I2/197


[1] Zarankiewicz K. On a problem of P. Turán concerning graphs. J. Fund. Math., 1954, 41:137-145
[2] Kleitman D J. The crossing number of K5,n. J. Combin. Theory, 1970, 9:315-323
[3] Ouyang Z D, Wang J, Huang Y Q. Two recursive inequalities for crossing numbers of graphs. Front. Math. China, 2017, 12(3):703-709
[4] Chia Gek L, Lee Chan L. Crossing numbers of nearly complete graphs and nearly complete bipartite graphs. ARS Combinatoria, 2015, 121:437-446
[5] Huang Y Q, Wang Y X. The crossing number of K5,n+1\e. Applied Mathematics and Computation, 2020, 376:125075
[6] Archdeacon D, Richter R B. On the parity of crossing numbers. J. Graph Theory, 1988, 12:307-310
[7] Asano K. The crossing number of K1,3,n and K2,3,n. J. Graph Theory, 1986, 10:1-8
[8] Huang Y Q, Zhao T L. The crossing number of K1,4,n. Discrete Mathematics, 2008, 308:1634-1638
[9] Mei H F, Huang Y Q. The crossing number of K1,5,n. International of Mathematical combinatorics, 2007, 1:33-44
[10] Klešč M. The join of graphs and crossing numbers. Electronic Notes in Discrete Math, 2007, 28:349-355
[11] Klešč M. The crossing numbers of join products of path with graphs of order four. Discussiones Mathematicae Gragh Theory, 2011, 31:321-331
[12] Klešč M. The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Mathematics, 2010, 310:1475-1481
[13] Klešč M. On the crossing numbers of Cartesian products of wheels and trees. Discussiones Mathematicae Graph Theory, 2017, 37:399-413
[14] P.Vasanthi Beulah. On the crossing number of join of a graph of order six with path and cycle. Journal of Progressive Research in Mathematics, 2016, 10(1):1439-1455
[15] Ding Z P, Huang Y Q. The crossing numbers of join of some graphs with n isolated vertices. Discussiones Mathematicae Graph Theory, 2018, 38:899-909

[1]苏振华, 黄元秋. K5,n\2e的交叉数[J]. 应用数学学报, 2020, 43(6): 984-999.
[2]王晶, 欧阳章东, 黄元秋. 交叉数为2且因子图为路的笛卡尔积图[J]. 应用数学学报, 2020, 43(1): 119-128.
[3]王晶, 欧阳章东, 黄元秋. 关于交叉数为1的联图[J]. 应用数学学报, 2017, 40(5): 727-733.
[4]苏振华. 联图K1,1,1,2+Pn的交叉数[J]. 应用数学学报, 2017, 40(3): 345-354.
[5]李阳, 黄元秋. 联图S5 ∨ Cn的交叉数[J]. 应用数学学报, 2016, 39(2): 173-183.
[6]欧阳章东, 黄元秋. 关于K2,2,2□Sn的交叉数[J]. 应用数学学报, 2015, 38(6): 968-975.
[7]袁梓瀚, 黄元秋, 刘金旺. 循环图C(9,2)与路Pn的笛卡尔积的交叉数[J]. 应用数学学报(英文版), 2013, 36(2): 350-362.
[8]马刚, 马少仙, 张忠辅. 一些联图的均匀全染色[J]. 应用数学学报(英文版), 2010, 33(4): 624-631.



PDF全文下载地址:

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

Free考研考试FreeKaoYan.Com
欢迎来到Free考研考试，"为实现人生的Free而奋斗"

© 2020 FreeKaoYan! . All rights reserved.