Up-Embeddability of Graphs with New Degree-Sum of Independent Vertices  

作　　者：Shengxiang LU Yanpei LIU 

机构地区：[1]Department of Mathematics, Hunan University of Science and Technology, Hunan 411201, P. R. China [2]Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China

出　　处：《Journal of Mathematical Research with Applications》2012年第4期399-406,共8页数学研究及应用（英文版）

基　　金：Supported by the Scientific Research Fund of Hunan Provincial Education Department (Grant No. 11C0541)

摘　　要：Let G be a k（k ≤3）-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/（4 k）} of G,if,then G is up-embeddable.Let G be a k（k ≤3）-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/（4 k）} of G,if,then G is up-embeddable.

关 键 词：up-embeddability maximum genus independent set. 

分 类 号：O157.5[理学—数学] G643.7[理学—基础数学]