The genus of a type of graph

作     者：SHAO ZeLing 1 & LIU YanPei 21 Department of Mathematics, Hebei University of Technology, Tianjin 300401, China 2 Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China 

作者机构：Department of Mathematics Hebei University of Technology Tianjin China Department of Mathematics Beijing Jiaotong University Beijing China 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2010年第53卷第9期

页      面：457-464页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：国家自然科学基金 

主　　题：surface joint tree embedding genus 

摘      要：Based on the joint tree model introduced by Liu, the genera of further types of graphs not necessary to have certain symmetry can be obtained. In this paper, we obtain the genus of a new type of graph with weak symmetry. As a corollary, the genus of complete tripartite graph K n,n,l (l≥n≥2) is also derived. The method used here is more direct than those methods, such as current graph, used to calculate the genus of a graph and can be realized in polynomial time.