The {\it crossing number} of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. The {\it n-dimensional folded hypercube} FQn is a graph obtained from n-dimensional hypercube by adding all complementary edges. In this paper, we obtain upper and lower bounds of the crossing number of FQn.
@article{arxiv.1101.3386,
title = {The crossing number of folded hypercubes},
author = {Haoli Wang and Yuansheng Yang and Yan Zhou and Wenping Zheng and Guoqing Wang},
journal= {arXiv preprint arXiv:1101.3386},
year = {2015}
}