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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
