A note on the cross-index of a complete graph based on a linear tree-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A note on the cross-index of a complete graph based on a linear tree

Published:2018-10 Issue:11 Volume:27 Page:1843010
ISSN:0218-2165
Container-title:Journal of Knot Theory and Its Ramifications
language:en
Short-container-title:J. Knot Theory Ramifications

Author:

Gokan Yusuke¹²,Katsumata Hayato¹²,Nakajima Katsuya¹²,Shimizu Ayaka¹²,Yaguchi Yoshiro¹²

Affiliation:

1. Department of Information and Computer Engineering, National Institute of Technology, Gunma College, 580 Toriba-cho, Maebashi-shi, Gunma 371-8530, Japan

2. Department of Mathematics, National Institute of Technology, Gunma College, 580 Toriba-cho, Maebashi-shi, Gunma 371-8530, Japan

Abstract

In this paper, it is shown that a complete graph with [Formula: see text] vertices has an optimal diagram, i.e. a diagram whose crossing number equals the value of Guy’s formula, with a free maximal linear tree and without free Hamiltonian cycles for any odd integer [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Algebra and Number Theory

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218216518430101

Reference11 articles.

1. The 2-Page Crossing Number of $$K_{n}$$ K n

2. Shellable Drawings and the Cylindrical Crossing Number of $$K_{n}$$ K n

3. Crossing numbers of graphs

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cross-index of a Graph;KYUNGPOOK MATH J;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP