期刊文献+

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

Up-Embeddability of Graphs with New Degree-Sum of Independent Vertices
原文传递
导出
摘要 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.
出处 《Journal of Mathematical Research with Applications》 CSCD 2012年第4期399-406,共8页 数学研究及应用(英文版)
基金 Supported by the Scientific Research Fund of Hunan Provincial Education Department (Grant No. 11C0541)
关键词 up-embeddability maximum genus independent set. up-embeddability maximum genus independent set.
  • 相关文献

参考文献1

共引文献45

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部