Author:
Beineke Lowell W.,Harary Frank
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.
Publisher
Canadian Mathematical Society
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quasirandom-Forcing Orientations of Cycles;SIAM Journal on Discrete Mathematics;2023-11-14
2. The Genus of a Graph: A Survey;Symmetry;2023-01-23
3. Embedding Grid Graphs on Surfaces;Graphs and Combinatorics;2022-04-16
4. A New View of Hypercube Genus;The American Mathematical Monthly;2021-03-23
5. Riemann surfaces for KPZ with periodic boundaries;SciPost Physics;2020-01-22