3-边连通图的Betti亏数与奇度点  

Betti Deficiency of 3-Edge Connected Graphs with Odd Degree Vertices

作　　者：吕胜祥[1] 刘彦佩[1] 刘峰[2] 

机构地区：[1]北京交通大学理学院,北京100044 [2]北京信息职业技术学院,北京100016

出　　处：《北京交通大学学报》2009年第6期20-22,共3页JOURNAL OF BEIJING JIAOTONG UNIVERSITY

基　　金：国家自然科学基金资助项目(10771062)

摘　　要：图G是3-边连通的且G的奇度点的数目为k.若k小于等于4,则G是上可嵌入的;若k大于等于6,则ξ(G)小于等于k/2减去1.而且当k不小于6时,存在无限多个3边连通图G使得ξ(G)等于k/2减去1.For a 3-edge connected graph G, the number of vertices with odd degree in G is k. If k less than or egual to 4, then G is up-embeddable; if k not less than 6, then ξ（G） is less than or equal to k/2 minus 1. Furthermore, when k not less than 6, there are infinite number of 3-edge connected sim- ple graphs with ξ（G） equal to k/2 minus 1.

关 键 词：最大亏格 上可嵌入 BETTI亏数 2-胞腔嵌入 

分 类 号：O157.5[理学—数学]