Randomly Orthogonal (p, f)-factorizations in Graphs  

作　　者：Gui-zhen Liu, He-ping LongDepartment of Mathematics, Shandong University, Jinan 250100, ChinaDepartment of Mathematics, Shandong University at Weihai, Weihai 264209, China 

出　　处：《Acta Mathematicae Applicatae Sinica》2002年第3期489-494,共6页应用数学学报（英文版）

基　　金：the National Natural Science Foundation of China (No.60172003,19831080) by NSF of Shandong Province.

摘　　要： Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued functions defined on V(G) such that 2k-1≤g(x) ≤ f(x) for all x ∈ V(G). Let H be a subgraph of G with mk edges . In this paper it is proved that every (mg + m - 1,mf- m + 1)-graph G has (g, f)-factorizations randomly κ-orthogonal to H and shown that the result is best possible.Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valued functions defined on V(G) such that 2k-1≤g(x) ≤ f(x) for all x ∈ V(G). Let H be a subgraph of G with mk edges . In this paper it is proved that every (mg + m - 1,mf- m + 1)-graph G has (g, f)-factorizations randomly κ-orthogonal to H and shown that the result is best possible.

关 键 词：GRAPH (g f)-factorization randomly fc-orthogonal factorization 

分 类 号：O157.5[理学—数学]