期刊文献+

(g,f)-FACTORS WITH SPECIAL PROPERTIES IN BIPARTITE (mg,mf)-GRAPHS

(g,f)-FACTORS WITH SPECIAL PROPERTIES IN BIPARTITE (mg,mf)-GRAPHS
下载PDF
导出
摘要 Let G be a bipartite graph and g and f be two positive integer-valued functions defined on vertex set V(G) of G such that g(x)≤f(x).In this paper,some sufficient conditions related to the connectivity and edge-connectivity for a bipartite (mg,mf)-graph to have a (g,f)-factor with special properties are obtained and some previous results are generalized.Furthermore,the new results are proved to be the best possible. Let G be a bipartite graph and g and f be two positive integer-valued functions defined on vertex set V(G) of G such that g(x)≤f(x).In this paper,some sufficient conditions related to the connectivity and edge-connectivity for a bipartite (mg,mf)-graph to have a (g,f)-factor with special properties are obtained and some previous results are generalized.Furthermore,the new results are proved to be the best possible.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第2期133-139,共7页 高校应用数学学报(英文版)(B辑)
基金 Supported by the National Natural Science Foundation of China( 60 1 72 0 0 3) NSF of Shandongprovince ( Z2 0 0 0 A0 2 )
关键词 CONNECTIVITY edge-connectivety bipartite (mg mf)-graph (g f)-factor vertex cover. connectivity, edge-connectivety, bipartite (mg,mf)-graph,(g,f)-factor, vertex cover.
  • 相关文献

参考文献2

  • 1P. Katerinis,N. Tsikopoulos.Perfect matchings in regular bipartite graphs[J].Graphs and Combinatorics.1996(1)
  • 2Liu Guizhen,Zhu Benhai.Some problems on factorizations with constrains in bipartite graphs, Discrete Appl[].Mathematica Journal.2003

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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