The Genus of the n-Cube
- 1 January 1965
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 17, 494-496
- https://doi.org/10.4153/cjm-1965-048-6
Abstract
The definition of the genus γ(G) of a graph G is very well known (König 2): it is the minimum genus among all orientable surfaces in which G can be drawn without intersections of its edges. But there are very few graphs whose genus is known. The purpose of this note is to answer this question for one family of graphs by determining the genus of the n-cube.The graph Qn called the n-cube has 2n vertices each of which is a binary sequence a1a2. . . an of length n, where ai = 0 or 1.Keywords
This publication has 1 reference indexed in Scilit:
- Inequalities involving the genus of a graph and its thicknessesProceedings of the Glasgow Mathematical Association, 1965