摘要
设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)-可因子化的若干充分条件.
Let G be a graph and g,fbe 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) ≤ dp(x) ≤ f(x) for everyx ∈ 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.
出处
《安徽大学学报(自然科学版)》
CAS
北大核心
2006年第5期10-12,共3页
Journal of Anhui University(Natural Science Edition)
关键词
图
因子
因子分解
graph
factor
factorization