(g,f)-Factorizations Randomly Orthogonal to a Subgraph in Graphs  

作　　者：HaoZHAO GuiZhenLIU XiaoXiaYAN 

机构地区：[1]DepartmentofComputerScience,CityUniversityofHongKong,Kowloon,HongKong [2]DepartmentofMathematics,ShandongUniversity,Jinan250100,P.R.China [3]DepartmentofAppliedMathematics,BeijingInstituteofTechnology,Beijing100081,P.R.China

出　　处：《Acta Mathematica Sinica,English Series》2005年第2期413-422,共10页数学学报（英文版）

基　　金：The work is partially supported by NNSF of China(10471078)RSDP of China

摘　　要：Let G be a graph with vertex set V(G) and edge set E(G) and let g and f betwo integer-valued functions defined on V(G) such that 2k - 2 ≤ 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 +l)-graph G has (g, f)-factorizations randomly k-orthogonal to H under some special conditions.Let G be a graph with vertex set V(G) and edge set E(G) and let g and f betwo integer-valued functions defined on V(G) such that 2k - 2 ≤ 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 +l)-graph G has (g, f)-factorizations randomly k-orthogonal to H under some special conditions.

关 键 词：graph (g  f)-factorization randomly k-orthogonal factorization 

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