The crossing number of locally twisted cubes

Details The crossing number of locally twisted cubes The crossing number of locally twisted cubes

2011-03-22

arxiv.org/abs/1103.4227v1

Mathematics

Combinatorics

17 pages, 12 figures

Scientific paper

The {\it 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 {\bf 59}, 145--161 (2008)] which solves the upper bound conjecture on the crossing number of $n$-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.

Affiliated with

Also associated with

No associations

Rating

The crossing number of locally twisted cubes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The crossing number of locally twisted cubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The crossing number of locally twisted cubes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-48440