图的最大亏格与图的顶点划分

Maximum Genus and Vertex Partition of Graphs

本文研究了图的Betti亏数与图的顶点划分的导出子图之间的关系，得到了图的最大亏格上界由其顶点划分的导出子图所表达的关系式，由此给出了图的最大亏格的一些新结果．

This paper studies the relationship between the Betti deficiency and the vertex-induced subgraph of vertex partition of graphs, and obtains an expression on the upper bounds on the mtalmum genus of a graph in terms of the vertex-induced subgraphs for vertex partition. Therefore some now results on the maximum genus of graphs are given.