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

作　　者：BianQiuju LiuGuizhen 

机构地区：[1]SchoolofMathematicsandSystemScience,ShandongUniversity,Jinan250100,China

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》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 )

摘　　要：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.

关 键 词：CONNECTIVITY edge-connectivety bipartite (mg mf)-graph (g f)-factor vertex cover. 

分 类 号：O174.52[理学—数学]