The splitting number of the 4-cube
The splitting number of a graph G is the smallest integer k ≥ 0 such that a planar graph can be obtained from G by k splitting operations. Such operation replaces v by two nonadjacent vertices v1 and v2, and attaches the neighbors of v either to v1 or to v2. The n-cube has a distinguished plaice in Computer Science. Dean and Richter devoted an article to proving that the minimum number of crossings in an optimum drawing of the 4-cube is 8, but no results about splitting number of other nonplanar n-cubes are known. In this note we give a proof that the splitting number of the 4-cube is 4. In addition, we give the lower bound 2n−2 for the splitting number of the n-cube. It is known that the splitting number of the n-cube is O(2n), thus our result implies that the splitting number of the n-cube is λ(2n).
KeywordsComplete Bipartite Graph Black Vertex Layout Algorithm Auxiliary Graph Nonadjacent Vertex
Unable to display preview. Download preview PDF.
- 2.M. S. Anderson, R. B. Richter and P. Rodney (1997). “The crossing number of C 7×C 7”. Proc. 28th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA.Google Scholar
- 5.P. Eades and C. F. X. MendonÇa (1993). “Heuristics for Planarization by Vertex Splitting”. Proc. ALCOM Int. Workshop on Graph Drawing, GD'93, 83–85.Google Scholar
- 6.P. Eades and C. F. X. MendonÇa (1996). “Vertex Splitting and Tension-Free Layout”. Proc. GD'95, Lecture Notes in Computer Science 1027, 202–211.Google Scholar
- 7.R. B. Eggleton and R. P. Guy (1970). “The crossing number of the n-cube”, AMS Notices 17, 757.Google Scholar
- 8.L. Faria (1994). “Bounds for the crossing number of the n-cube”, Master thesis, Universidade Federal do Rio de Janeiro (In Portuguese).Google Scholar
- 9.L. Faria and C. M. H. Figueiredo (1997). “On the Eggleton and Guy conjectured upper bound for the crossing number of the n-cube”, submitted to Math. Slovaca.Google Scholar
- 10.L. Faria, C. M. H. Figueiredo and C. F. X. MendonÇa (1997). “Splitting number is NP-Complete”, Technical Report ES-443/97, COPPE/UFRJ, Brazil.Google Scholar
- 16.F. T. Leighton (1981). “New lower bound techniques for VLSI”, Proc. 22nd Annual Symposium on Foundations of Computer Science, Long Beach CA, 1–12.Google Scholar
- 17.A. Liebers (1996). “Methods for Planarizing Graphs — A Survey and Annotated Bibliography”, ftp://ftp.informatik.uni-konstanz.de/pub/preprints/1996/preprint-012.ps.Z.Google Scholar
- 20.C. F. X. MendonÇa (1994). “A Layout System for Information System Diagrams”, Ph.D. thesis, University of Queensland, Australia.Google Scholar