期刊文献+

分数(g,f,n)-临界图的韧度条件的改进

The Improvement of Toughness Condition for a Graph to be Fractional(g,f,n)-critical
下载PDF
导出
摘要 讨论了分数(g,f,n)-临界图与韧度之间的关系,对于满足条件1≤a≤b和b≥(1+√(4n+5))/2的正整数a,b,n,证明了当图的韧度满足t(G)≥(b-1)(b+n+1)/a时,图G是分数(g,f,n)-临界图。 The relationship between toughness and(g, f, n)-critical graph is considered. It is proved that a graph G is(g, f, n) critical if, t (G) ≥ (b- 1 ) (b+ n+ 1)/a, where a, b and n are integers such that.
出处 《潍坊学院学报》 2013年第2期70-74,共5页 Journal of Weifang University
基金 山东省自然科学基金(ZR0211Al008) 潍坊市科技发展计划项目(2012104)
关键词 韧度 分数(g f)-因子(g f n)临界图 graph, toughness, fractional (g, f) - factor, fractional (g, f, n)-critical graph
  • 相关文献

参考文献15

  • 1Bian Q. On toughness and fractional f-factors[J]. Ars Combinatoria, 2008,87 : 175- 180.
  • 2Bondy J A, Murty U S R. Graph theory with applications[M]. London: Macmillan, 1976.
  • 3Chvatal V. Tough graphs and hamiltonian circuits[J]. Discrete Math, 1973,5:215-228.
  • 4李建湘.(a,b,n)-临界图的几个充分条件(英文)[J].应用数学,2004,17(3):450-455. 被引量:2
  • 5Li J, Matsuda H. On (g, f, n)-critical graphs[J]. Ars Combinatoria, 2006,78: 71-82.
  • 6Liu S, Cai J. Toughness and existence of fractional (g, f)-factors in graphs[J]. Ars Combinatoria, 2009,93:305-311.
  • 7Liu G, Zhang L. Toughness and the existence of fractional k-factors of graphs[J]. Discrete Mathematics, 2008,308:1741- 1748.
  • 8刘桂真,王建方.(a,b,k)-临界图(英)[J].数学进展,1998,27(6):536-540. 被引量:18
  • 9Liu G, Zhang L. Fractional (g, f)-factors of graphs[J]. Acta Math Scientia Ser B, 2001,21(4):541-545.
  • 10Liu H, Liu G. Binding number and minimum degree for the existence of (g, f, n)-critical graphs[J]. J Appl Math &Com- puting, 2009,29 : 207-216.

二级参考文献4

  • 1Yu Q,Australas J Comb,1993年,7卷,55页
  • 2Heinrich K,Discret Math,1990年,85卷,315页
  • 3刘桂真,Discret Math
  • 4刘桂真,王建方.(a,b,k)-临界图(英)[J].数学进展,1998,27(6):536-540. 被引量:18

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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