首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的上可嵌入性与独立顶点的新度和
引用本文:吕胜祥,刘彦佩.图的上可嵌入性与独立顶点的新度和[J].数学研究及应用,2012,32(4):399-406.
作者姓名:吕胜祥  刘彦佩
作者单位:湖南科技大学数学学院,湖南 湘潭 411201;北京交通大学数学系, 北京 100044
基金项目:湖南省教育厅资助项目(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.

关 键 词:up-embeddability  maximum  genus  independent  set
收稿时间:2010/12/11 0:00:00
修稿时间:9/1/2011 12:00:00 AM

Up-Embeddability of Graphs with New Degree-Sum of Independent Vertices
Shengxiang LV and Yanpei LIU.Up-Embeddability of Graphs with New Degree-Sum of Independent Vertices[J].Journal of Mathematical Research with Applications,2012,32(4):399-406.
Authors:Shengxiang LV and Yanpei LIU
Institution:Department of Mathematics, Hunan University of Science and Technology, Hunan 411201, P. R. China;Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China
Abstract:Let $G$ be a $k$($k\leq 3$)-edge connected simple graph with minimal degree $\geq3$, girth $g$, $r=\lfloor\frac{g-1}{2}\rfloor$. For any independent set $\{a_1,a_2,\ldots,a_{6/(4-k)}\}$ of $G$, if $$ \sum_{i=1}^{6/(4-k)}d_G(a_i)>\frac{(4-k)\nu(G)-6(g-2r-\lfloor\frac{k}{3}\rfloor)}{(4-k)(2^r-1)(g-2r)}+\frac{6}{(4-k)}(g-2r-1), $$ then $G$ is up-embeddable.
Keywords:up-embeddability  maximum genus  independent set  
本文献已被 CNKI 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号