Affiliation:
1. School of Mathematics and Computing Sciences, Huaihua University, Huaihua 418000, China
Abstract
The crossing numbers of graphs were started from Turán’s brick factory problem (TBFP). Because of its wide range of applications, it has been used in computer networks, electrical circuits, and biological engineering. Recently, many experts began to pay much attention to the crossing number of
, which obtained from graph
by deleting an edge
. In this paper, by using some combinatorial skills, we determine the exact value of crossing numbers of
and
. These results are an in-depth work of TBFP, which will be beneficial to the further study of crossing numbers and its applications.
Funder
Education Department of Hunan Province
Subject
General Engineering,General Mathematics
Reference28 articles.
1. A note of welcome;P. Turán;Journal of Graph Theory,1977
2. New lower bound techniques for VLSI
3. Crossing number bounds for the mesh of trees;R. Cimikowski
4. Applications of the crossing number
5. Adaptive crossing numbers and their application to binary downsampling;D. Etienne;Image Analysis and Stereology,2007
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献