摘要
设G是一个图,g,f是定义在图G的顶点集上的两个整数值函数且图G的一个(g,f)-因子是G的一个支撑子图F使对任意的x∈V(F)有本文给出了一个图(g,f)-可因子化的若干充分条件和一个图是(g,f)-消去图的充分必要条件,并研究了这些条件的应用。
Let G be a graph and g,j be two integer-valued hinctions defined on the vertexset of G and (g,f)-factor of a graph G is a spanning subgraph F of G such thatfor each vertex x of F Inthis paper some sumcient conditions for a graphto be (g,f)-factorable and a necessary and sufficient condition for a grah to be a (g,f)-deleted guaph are given Some applications of these conditions are discussed .
出处
《数学学报(中文版)》
SCIE
CSCD
北大核心
1994年第2期230-237,共8页
Acta Mathematica Sinica:Chinese Series
基金
高校博士点基金