Minimal Embedding of Hypercubic Graphs on Surface
In this paper, we propose a minimal embedding of a non-planar, n-dimensional hypercubic graph on a surface as a “standard” embedding. The “standard” form of embedding graph on a surface has been understudied and therefore, has remained undefined. The aim of this paper is to define what the “standard form” is for a non-planar graph, while distinguishing different embedding patterns of a graph. As a result, we defined a value ω(G) for all non-planar graphs G, and determined the value ω(Q n ) for n-dimensional hypercubic graphs denoted by Q n .
KeywordsStandard Form Planar Graph Complete Graph Binary Sequence Complete Bipartite Graph
Unable to display preview. Download preview PDF.
- 2.Burde, G., Zieschang, H.: Knots (De Gruyter Studies in Mathematics), ch. 3, vol. 5. Walter De Gruyter Inc. (2002)Google Scholar
- 4.Kobayashi, K.: Various characteristics of regular projections of a planar graph and the extension of those characteristics to a non-planar graph. Hakone Seminar 22, 3–18 (2006) (in Japanese)Google Scholar