摘要
设G是二分图,k1,k2,…,km是正整数。若二分图G的边能划分成m个边不交的[0,k1]-因子F1,…,[0,km]-因子Fm,则称■={F1…Fm}是二分图G的一个[0,ki]1m-因子分解,又若H是二分图G的一个有m条边的子图,若对任意的1≤i≤m有E(H)∩E(Fi)∣=1,则称与H是正交的。本文主要研究二分图的正交[0,ki]1m-因子分解,并给出一个结果。
Let G be a bipartite graph, k1, k2,…, km be positive integers. If the edges of bipartite graph G can be decomposed into edge disioint [ 0 , k1 ] -factor ,F1,…, [ 0 ,km ] -factor Fm, then F^-= {F1,…, Fm} is called a [ 0 , ki ]1^m-factorization of bipartite graph G, in addition, if H is a subgraph with m edges in bipartite graph G and ｜E（H）∩E（Fi）｜=1 for all 1 ≤i≤m, then we call that F is orthogonal to H. This paper mainly studies orthogonal factorization of bipartite graph and gives one result.
出处
《延安教育学院学报》
2008年第4期69-70,共2页
Journal of Yanan College of Education
关键词
图
因子
因子分解
正交因子分解
graph, factor, factofization, orthogonal factorization
