八个点极小非环面图.PDFVIP

Advances in Applied Mathematics 应用数学进展, 2013, 2, 186-190 /10.12677/aam.2013.24025 Published Online November 2013 (/journal/aam.html) * Minimal Nontoroidal Graphs on Eight Vertices Fugang Chao, Han Ren Department of Mathematics, East China Normal University, Shanghai Email: chaofugang@126.com, hren@ Received: Jun. 28th th th , 2013; revised: Jul. 30 , 2013; accepted: Aug. 10 , 2013 Copyright © 2013 Fugang Chao, Han Ren. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract: Using the technique of embedding, we prove that the graphs obtained from K 8 , the complete graph on eight vertices, by deleting the edges of K3 , a triangle, or K 2,3 , the complete bipartite graph with 2 vertices and 3 vertices, or K K P , the disjoint union of two paths of length one and one path of length 2 2 3 two, are minimal nontoroidal graphs. Keywords: Embedding; Genus; Minimal Nontoroidal Graph 八个点的极小非环面图* 晁福刚，任 韩 华东师范大学数学系，上海 Email: chaofugang@126.com, hren@ 收稿日期：2013 年 6 月 28 日；修回日期：2013 年 7 月 30 日；录用日期：2013 年 8 月 10 日 摘 要：借助于嵌入的技巧，证明了由K8 ，八个点的完全图，去掉K3 ，三角形，或K 2,3 ，部集的点数 为 2 和 3 的完全二部图，或K K P ，长度为 1 的两条路和长度为 2 的一条路的不交并，中的