具有(n,k)-正交的(g,f)-因子分解的子图  

Subgraphs with (n,k)- Orthogonal (g,f)-Factorizations

作　　者：周思中[1] 薛秀谦[2] 

机构地区：[1]华东船舶工业学院数理系,江苏镇江212003 [2]中国矿业大学理学院,江苏徐州221008

出　　处：《华东船舶工业学院学报》2003年第6期27-30,共4页Journal of East China Shipbuilding Institute(Natural Science Edition)

摘　　要：设G是一个图,g和f是定义在V(G)上的两个整数函数且对每个x∈V(G)有g≤f。本文证明了如下结果:设k是一个正整数,G是一个(mg+nk,mf-nk) 图,其中1≤n<m,H是G的任意一个有nk条边的子图。若对每个x∈V(G)有g≥k,则G中存在子图R,R具有(g,f) 因子分解与H(n,k) 正交。Let G be a graph,and let g(x) and f(x) be two integer-valued functions defined on the vertex set V(G) of a graph G such that g(x)≤f(x) for every x∈V(G).This paper supposes that k is a positive integer,G is an (mg+nk,mf-nk)-graph,1≤n<m,H is any subgraph with nk edges of a graph G.If g≥k for every x∈V(G),then there exists a subgraph R in graph G,R has a (g,f)-factorization (n,k)-orthogonal to H.

关 键 词：图 子图 因子 因子分解 (n k)-正交 

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