(g,f)-FACTORIZATIONS OF GRAPHS ORTHOGONAL TO [1,2]-SUBGRAPH  

作　　者：阎桂英 

出　　处：《Acta Mathematicae Applicatae Sinica》1997年第4期371-375,共6页应用数学学报（英文版）

摘　　要：et G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(C) with j(x)≥g(x)≥1 for all x∈V(G). It is proved that if G is an (mg+m-1, m-m+1)-graph andH is a [1,2]-subgraph with m edges, then there exists a (g,i)-factorization of G orthogonal to H.et G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(C) with j(x)≥g(x)≥1 for all x∈V(G). It is proved that if G is an (mg+m-1, m-m+1)-graph andH is a [1,2]-subgraph with m edges, then there exists a (g,i)-factorization of G orthogonal to H.

关 键 词：GRAPH FACTORIZATION orthogonasl 

分 类 号：O29[理学—应用数学]