期刊文献+

点度,围长与图的上可嵌入性

Vertice Degree,Girth and Upper Embeddability in Graphs
在线阅读 下载PDF
导出
摘要 结合连通度、点度及围长等条件,给出了两类新的上可嵌入图,且前者条件中的界是不可达的,而后者条件中的界是最好的。  Combining with connected degree,vertice degree and girth,two classes of new and upper embeddable graphs are put forward.However,the boundary of the former conditions does impossibly reach and the latter is the best one.
出处 《湖南工业大学学报》 2007年第6期26-30,共5页 Journal of Hunan University of Technology
基金 国家自然科学基金资助项目(10771062)
关键词 BETTI亏数 上可嵌入性 点度 围长 graph Betti deficiency upper embeddability vertice degree girth
  • 相关文献

参考文献11

二级参考文献46

  • 1[2]Y Liu.Embeddability in graph[M].Beijing:Kluwer&Science, 1995.
  • 2[3]L Nebseky.A new characterization of the maximum genus of a graph[J].Czech.Math.J.1981,(106),604-613.
  • 3[4]Y Q Huang and Y P Liu.Maximum genus of graphs with diameter three[J].Discrete Math,1999,(194):139-149.
  • 4Nordhaus E, Stewart B, White A. On the Maximum Genus of a Graph. J Combinatorial Theory B, 1971,11:258-267.
  • 5Skoviera M. The Maximum Genus of Graphs of Diameter Two. Discrete Math. 1991, 87:175-180.
  • 6Skoviera M. The Decay Number and the Maximum Genus of a Graph. Math Slovaca,1992,42(4):391-406.
  • 7Nebesky L. Every Connected, Locally Connected Graph is Upper Embeddabel. J Graph Theory, 1981, 5:205-207.
  • 8Nebesky L. On Locally Quaisconnected Graphs and Their Upper Embeddablity. Czechoslovak Math J, 1985,35:162-166.
  • 9Nedela R, Skoviera M. On Graphs Embeddable with Short Faces. Topics in Combinatorial and Graph Theory. R Bodendiek and R Henn(Eds), Physicaverlay, Heidelberg, 1990:519-529.
  • 10Skoviera M, Nedel R. The Maximum Genus of a Graph and Doubly Eulerian Trails. J U M Bollettino (Series B), 1990,4:541-551.

共引文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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