MAXIMUM GENUS,INDEPENDENCE NUMBER AND GIRTH

作     者：HUANGYUANQIU LIUYANPEI 

作者机构：DepartmentofMathematicsNormalUniversityofHunanChangsha410081China. DepartmentofMathematicsNorthernJiaotongUniversityBeijing100044China. 

出 版 物：《Chinese Annals of Mathematics,Series B》 (数学年刊（B辑英文版）)

年 卷 期：2000年第21卷第1期

页      面：77-82页

核心收录：

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

基　　金：National Natural Science Foundation of China!(No.19801013) 

主　　题：围长 极大亏格 独立数 图形 

摘      要：It is known (for example see [2]) that the maximum genus of a graph is mainly determined by the Betti deficiency of the graph. In this paper, the authors establish an upper bound on the Betti deficiency in terms of the independence number as well as the girth of a graph, and thus use the formulation in [2] to translate this result to lower bound on the maximum genus. Meantime it is shown that both of the bounds are best possible.