Applied Mathematics and Mechanics (English Edition) ›› 1997, Vol. 18 ›› Issue (4): 407-410.

• 论文 • 上一篇    

ON(g,f)-FACTORIZATIONS OF GRAPHS

马润年1, 高行山2   

  1. 1. Air Force Telecommunication Engineering institute, Xi’an 710077, P. R. China;
    2. Northwestern Polytechnical University, Xi’an 710072, P. R. China
  • 收稿日期:1995-07-10 修回日期:1996-04-22 出版日期:1997-04-18 发布日期:1997-04-18

ON(g,f)-FACTORIZATIONS OF GRAPHS

Ma Runnian1, Gao Hangshan2   

  1. 1. Air Force Telecommunication Engineering institute, Xi’an 710077, P. R. China;
    2. Northwestern Polytechnical University, Xi’an 710072, P. R. China
  • Received:1995-07-10 Revised:1996-04-22 Online:1997-04-18 Published:1997-04-18

摘要: Let G be a graph and g, f be two nonnegative integer-valued functions defined on thevertices set V(G) of G and g≤f, A (g, f)-factor of a graph G is a spanning subgraph F of G such that g(x)≤dF(x)≤f(x) for all x∈V(G). If G itself is a (g, f)-factor, then itis said that G is a (g, f)-graph. If the edges of G can be decomposed into some edgedisjoint (g, f)-factors, then it is called that G is (g, f)-factorable. In this paper, onesufficient condition for a graph to be (g, f)-factorable is given.

关键词: graph, factor, factorization

Abstract: Let G be a graph and g, f be two nonnegative integer-valued functions defined on thevertices set V(G) of G and g≤f, A (g, f)-factor of a graph G is a spanning subgraph F of G such that g(x)≤dF(x)≤f(x) for all x∈V(G). If G itself is a (g, f)-factor, then itis said that G is a (g, f)-graph. If the edges of G can be decomposed into some edgedisjoint (g, f)-factors, then it is called that G is (g, f)-factorable. In this paper, onesufficient condition for a graph to be (g, f)-factorable is given.

Key words: graph, factor, factorization

APS Journals | CSTAM Journals | AMS Journals | EMS Journals | ASME Journals