| 二分图上有限制条件的(g,f)-因子分解 |
| |
| 引用本文： | 杨芳,车向凯. 二分图上有限制条件的(g,f)-因子分解[J]. 吉林师范大学学报(自然科学版), 2009, 30(4) |
| |
| 作者姓名： | 杨芳 车向凯 |
| |
| 作者单位： | 1. 沈阳建筑大学,城市建设学院,辽宁,沈阳,110004
2. 东北大学理学院,辽宁,沈阳,110004 |
| |
| 摘 要： | 设G=(X,Y,E)是二分图,g,f是定义在V(G)上的正整数值函数,且对任意的x∈V(G)有g(x)＜f(x).令G是(mg,mf-1)-图,证明了:①若,g(x)≥1,H是G的任一含有m条边的子图.则G有一个(g,,)-因子分解与H-正交.②若g(x)≥2,H是G的任一含有2m条边的子图,则G有一个(g,f)-因子分解与H2-正交.
|
| 关 键 词： | 二分图 (g,f)-因子 正交因子分解 |
(g,f)-Factorization with constraints in bipartite graphs |
| |
| YANG Fang,CHE Xiang-kai. (g,f)-Factorization with constraints in bipartite graphs[J]. Jilin Normal University Journal(Natural Science Edition), 2009, 30(4) |
| |
| Authors: | YANG Fang CHE Xiang-kai |
| |
| Abstract: | Let G = (X ,Y,E) be a bipartite graph and let g and / be two positive integer functions defined on V(G) with g(x)＜f(x) for each x∈V(G).Let G is (mg,mf-1)-graph.It is proved that ①if g(x)≥1,H is a subgraph of G with m edges,then G has a (g,f)-factorization orthogonal to H;②if g(x)≥2,H is a subgraph of G with 2m edges,then G has a (g,f)-factorization 2-orthogonal to H. |
| |
| Keywords: | bipartite graph (g,f)-factor orthogonal factorization |
| 本文献已被 万方数据 等数据库收录！ |
|
