首页 | 本学科首页   官方微博 | 高级检索  
     


Even Embeddings of the Complete Graphs and Their Cycle Parities
Authors:Kenta Noguchi
Affiliation:DEPARTMENT OF INFORMATION ENVIRONMENT, TOKYO DENKI UNIVERSITY, INZAI, JAPAN
Abstract:The complete graph urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0001 on n vertices can be quadrangularly embedded on an orientable (resp. nonorientable) closed surface F2 with Euler characteristic urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0002 if and only if urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0003 (resp. urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0004 and urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0005). In this article, we shall show that if urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0006 quadrangulates a closed surface F2, then urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0007 has a quadrangular embedding on F2 so that the length of each closed walk in the embedding has the parity specified by any given homomorphism urn:x-wiley:03649024:media:jgt22055:jgt22055-math-0008, called the cycle parity.
Keywords:current graph  cycle parity  even embedding  quadrangulation
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号