Abstract
The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four, including crossed cube, locally twisted cube and Möbius cube.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.