关于图的(g,f)-因子分解

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名

邮箱

手机号码

标题

留言内容

验证码

On(g, f)-Factorizations of Graghs

1.
Air Force Telecommunication Engineering Institute, Xi'an 710077, P. R. China;
2.
Northwesten Polytechnical Unfversity, Xi' an 710072, P. R. China

摘要: 设G是一个图,g和f是定义在图G的顶点集V(G)上的两个非负整数值函数且g＜f.图G的一个(g,f)-因子是G的一个支撑子图F,使对所有的x∈V(G)有g(x)≤d_F(x)≤f(x).若G本身是一个(g,f)-因子,则称G是一个(g,f)-图.若G的边能分解成一些边不交的(g,f)-因子,则称G是(g,f)-因子可分解的.本文给出图G是(g,f)-因子可分解的一个充分条件.
- 图 /
- 因子 /
- 因子分解
Abstract: Let G be a graph and g, f be two nonnegative integer-valued functions defined on thevertices set V(G) of G and g≤f, 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 all x∈V(G). If G itself is a (g, f)-factor, then itis said that G is a (g, f)-graph. If the edges of G can be decomposed into some edgedisjoint (g, f)-factors, then it is called that G is (g, f)-factorable. In this paper, onesufficient condition for a graph to be (g, f)-factorable is given.
- graph /
- factor /
- factorization

[1]	J.Akiyama and M, Kano, Factors and factorizations of graphs-a survey,Journal of Graph Theory,9(1985),1-42.
[2]	M,K ano,[a,b]-Factorization of a graph,Journal of Graph Theory,9(1985),129-146.
[3]	M,C.Cai,On some factor theorems of graphs,Discrete Mathematics,98(1991),225-229.
[4]	马润年、白国强,图的(g.f)一因子分解,内蒙古大学学报(自然科学版),22(1991),296-299.
[5]	马润年,图的(g.f)一因子和(g. f)一因子分解,空军电讯工程学院学报,14(1992),71-76.
[6]	刘桂真,图的(g.f)一因子和因子分解,数学学报,37(1994),130-137,