An upper bound for the crossing number of bubble-sort graph Bn
Discrete Mathematics
2012-11-20 v1 Combinatorics
Abstract
The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. 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 59, 145-161 (2008)], we give an upper bound of the crossing number of n-dimensional bubble-sort graph Bn.
Keywords
Cite
@article{arxiv.1211.4433,
title = {An upper bound for the crossing number of bubble-sort graph Bn},
author = {Baigong Zheng and Yuansheng Yang and Xirong Xu},
journal= {arXiv preprint arXiv:1211.4433},
year = {2012}
}
Comments
20 pages, 10 figures