| 关于图的最大亏格的下界 |
| |
| 引用本文： | 黄元秋.关于图的最大亏格的下界[J].系统科学与数学,2000,20(1):124-128. |
| |
| 作者姓名： | 黄元秋 |
| |
| 作者单位： | 黄元秋（湖南师范大学数学系, 长沙 410081） |
| |
| 基金项目： | 国家自然科学基金资助课题. |
| |
| 摘 要： | 主要考虑2-边和3-边连通图的最大亏格下界情形,推广了J.Chen等(1996)的主要结果,证明了
|
| 关 键 词： | 图 Betti亏数 上可嵌入 最大亏格 |
| 修稿时间： | 1997年7月15日 |
On the Lower Bounds of the Maximum Genus of Graphs |
| |
| Yuan Qiu HUANG,Yan LIU.On the Lower Bounds of the Maximum Genus of Graphs[J].Journal of Systems Science and Mathematical Sciences,2000,20(1):124-128. |
| |
| Authors: | Yuan Qiu HUANG Yan LIU |
| |
| Institution: | (1)Dept.of Math.,Hunnan Normal Univ.,Changsha 410081,P.R.China;(2)Dept.of Math.,Northern Jiaotong Univ.,Beijing 100044,P.R.China |
| |
| Abstract: | This paper mainly considers the lower bounds on the maximum genus of 2- edge-connected and 3-edges-connected graphs, generalizes the main result in 7], and proves that (G) is the lower bounds on the maximum genus of any 3-edge-connected and some special 2-edge-connected graphs. In addition, the method used here provides the simple proof for the main results of 7]. |
| |
| Keywords: | Graph Betti deficiency number upper embeddable maximum genus |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
|
