关于图的上可嵌入性与非邻节点度和的一个注记  

Note on the Upper Embeddability of Graphs and Sum of the Degree of the Unneighbored Vetexes

作　　者：盛秀艳[1] 

机构地区：[1]重庆师范学院数学与计算机系,重庆400047

出　　处：《四川师范学院学报（自然科学版）》2003年第2期193-195,共3页Journal of Sichuan Teachers College(Natural Science)

基　　金：重庆市教委基金资助项目(960384)

摘　　要：进一步研究了2(或3) 边连通简单图的上可嵌入性与非邻节点度和的关系,得到如下结果:2 边连通简单图G为上可嵌入的条件及其下界表达式,而这个界是最好的,不能再继续改进;对于3 边连通的简单图,本文还给出了更为清楚的表达式.This paper studies the relationship between the upperembeddability of 2(or 3)edgeconnected simple graph and the sum of the degree of the unneighbored vertexes,and obtains the following results:it gives the condition that the 2edgeconnected simple graph is upperembeddable and the expressions of its lower bound;it also shows that the lower bound is the best,and cannot be improved;for 3edgeconnected simple graph,it gives the clearer expressions.

关 键 词：图论 2-边连通简单图 3-边连通简单图 上可嵌入性 非邻节点度和 2-胞腔嵌入 

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