The crossing number of pancake graph P₄ is six
classification
💻 cs.DM
math.CO
keywords
graphnumbercrossingpancakecomputerscrossingsdrawingsedges
read the original abstract
The {\it crossing number} of a graph $G$ is the least number of pairwise crossings of edges among all the drawings of $G$ 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 $P_4$ is six.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.