The crossing number of folded hypercubes

Details The crossing number of folded hypercubes The crossing number of folded hypercubes

2011-01-18

arxiv.org/abs/1101.3386v1

Mathematics

Combinatorics

Scientific paper

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} $FQ_n$ 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 $FQ_n$.

Affiliated with

Also associated with

No associations

Rating

The crossing number of folded hypercubes 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 folded hypercubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The crossing number of folded hypercubes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286299