| 图的(g,f)-因子分解 |
| |
| 引用本文： | 周思中.图的(g,f)-因子分解[J].安徽大学学报(自然科学版),2006,30(5):10-12. |
| |
| 作者姓名： | 周思中 |
| |
| 作者单位： | 江苏科技大学,数理系,江苏,镇江,212003 |
| |
| 摘 要： | 设G是一个图,g和f是定义在图G的顶点集上的两个整数值函数,且g≤f.图G的一个(g,f)-因子是G的一个支撑子图F,使得对每个x∈V(F),有g(x)≤dF(x)≤f(x).若图G的边集能划分为若干个边不相交的(g,f)-因子,则称图G是(g,f)-可因子化的.本文研究了图的(g,f)-可因子化的问题,给出了一个图G是(g,f)-可因子化的若干充分条件.
|
| 关 键 词： | 图 因子 因子分解 |
| 文章编号： | 1000-2162（2006）05-0010-03 |
| 收稿时间： | 2006-01-10 |
| 修稿时间： | 2006-01-10 |
(g,f) - factorizations of graphs |
| |
| ZHOU Si-zhong.(g,f) - factorizations of graphs[J].Journal of Anhui University(Natural Sciences),2006,30(5):10-12. |
| |
| Authors: | ZHOU Si-zhong |
| |
| Institution: | Department of Mathematics and Physics, Jiangsu University of Science and Technology, Zhenjiang 212003, China |
| |
| Abstract: | Let G be a graph and g,f be two integer-valued functions defined on V(G) such that g≤f for every x∈V(G).A(g,f)-factor of a graph G is a spanning subgraph F of G such that g(x)≤d_F(x)≤f(x) for every x∈V(F).A graph G is said to be(g,f)-factorable if E(G) can be partitioned into several edge-disjoint(g,f)-factors.In this paper,we discuss the problems of(g,f)-factorizations of graphs,and some sufficient conditions for a graph to(g,f)-factorable are given. |
| |
| Keywords: | graph factor factorization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
