独立数≤5的3-边连通简单图的上可嵌入性(英文)  

Upper Embeddability of 3-Edge-Connected Simple Graphs with Independence-Number≤5

作　　者：高岩波[1] 任韩[2] 

机构地区：[1]南通大学理学院,江苏南通226007 [2]华东师范大学数学系,上海200062

出　　处：《南京师大学报（自然科学版）》2006年第1期17-20,共4页Journal of Nanjing Normal University(Natural Science Edition)

基　　金：Supported by the National Natural Science Foundation of China(10271048)and Shanghai Priority Academic Discipline and Sci-ence and Technology Commission of Shanghai Municipality(04JC14031).

摘　　要：结合边连通度,本文探讨了3-边连通简单图的独立数与上可嵌入性的关系,我们得到了下列结果:设G是一个3-边连通简单图,α(G)是G的独立数,若α(G)≤5,则G是上可嵌入的,同时我们又得到了两个在3-边连通意义下最小的非上可嵌入图例.Combined with the edge-connectivity, this paper investigates the relationship between the independencenumber and the upper-embeddability of a 3-edge-connected simple graph and obtains the following result ： Let G be a 3- edge-connected simple graph with or（G） ≤5 （where ct（G） is the independence-number of G）, then G is upper embeddable, and two minimal examples are given in the sense that there are 3-edge-connected graphs which are not upper embeddable.

关 键 词：图 最大亏格 BETTI亏数 上可嵌入的 独立数 

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