The crossing number of locally twisted cubes
Combinatorics
2015-03-19 v1
Abstract
The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing number of the hypercube. J. Graph Theory {\bf 59}, 145--161 (2008)] which solves the upper bound conjecture on the crossing number of -dimensional hypercube proposed by Erd\H{o}s and Guy, we give upper and lower bounds of the crossing number of locally twisted cube, which is one of variants of hypercube.
Cite
@article{arxiv.1103.4227,
title = {The crossing number of locally twisted cubes},
author = {Haoli Wang and Xirong Xu and Yuansheng Yang and Bao Liu and Wenping Zheng and Guoqing Wang},
journal= {arXiv preprint arXiv:1103.4227},
year = {2015}
}
Comments
17 pages, 12 figures