东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

Two recursive inequalities for crossing numbers of graphs

ISSN号：1000-0984
期刊名称：《数学的实践与认识》
时间：0
分类：T[一般工业技术]
作者机构：[1]Department of Mathematics, Hunan First Normal University, Changsha 410205, China, [2]Department of Mathematics, Changsha University, Changsha 410003, China, [3]Department of Mathematics, Hunan Normal University, Changsha 410081, China
相关基金：The authors are indebted to the referees for their suggestions, which improved the presentation and made it more readable. This work was supported by the National Natural Science Foundation of China （Grant Nos. 11301169, 11371133）, Hunan Provincial Natural Science Foundation of China （Nos. 13J J4110, 14JJ3138）, and Hunan Education Department Talented Foundation （No. 16B028）.

作者： Zhangdong OUYANG[1], Jing WANG[2], Yuanqiu HUANG[3]

关键词：图, 绘画, 十字路口数字, 递归的不平等, Graph, drawing, crossing number, recursive inequality

中文摘要：

在这份报纸，为穿过图的数字的二递归的不平等被使用基本的数给方法。作为他们的应用，十字路口 K _{1,3， n} 和 K 数 _{4， n}\ e 分别地被决定。

英文摘要：

In this paper, two recursive inequalities for crossing numbers of graphs are given by using basic counting method. As their applications, the crossing numbers of K1,3,n and K4,n ／ e are determined, respectively.

同期刊论文项目