Abstract
The {\it crossing number} of a graph is the least number of pairwise crossings of edges among all the drawings of in the plane. The pancake graph is an important topology for interconnecting processors in parallel computers. In this paper, we prove the exact value of the crossing number of pancake graph is six.
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.