首页 | 本学科首页   官方微博 | 高级检索  
     检索      

(mg+k,mf—k)—图中正交于r个不相交子图的边不变的(g,f)—因子
引用本文:闫晓霞,刘桂真.(mg+k,mf—k)—图中正交于r个不相交子图的边不变的(g,f)—因子[J].应用数学,2001,14(4):37-41.
作者姓名:闫晓霞  刘桂真
作者单位:山东大学数学院,
基金项目:Supported by NNSF(1 983 1 0 80 ) and RSDP of China(Z2 0 0 0 A0 2 )
摘    要:设m,k和r为正整数,且使l≤k<m.设G是一个具有顶点集合V(G)和边集合E(G)的图,并设g和f是定义在V(G)上的使对每个x∈V(G)有r≤g(x)≤f(x)的整数值函数.设H1,H2,…,Hr是G的r个顶点不相交的子图且|E(Hi)|=k,1≤i≤r.本文证明了每个(mg+k,mf-k)-图有k个边不相交的(g,f)-因子正交于Hi,1≤i≤r.

关 键 词:  (g  f)-因子  正交因子分解  整数值函数  有限元方向图

Edge Disjoint (g,f)-Factors Orthogonal to r Disjoint Subgraphs in (mg+k, mf k)-Graphs
YAN Xiao-xia,LIU Gui-zhen.Edge Disjoint (g,f)-Factors Orthogonal to r Disjoint Subgraphs in (mg+k, mf k)-Graphs[J].Mathematica Applicata,2001,14(4):37-41.
Authors:YAN Xiao-xia  LIU Gui-zhen
Abstract:In this paper it is proved that every (mg k,mf-k)-graph has k edge disjoint (g,f)-factors which are orthogonal to H_i for i=1,2,...,r. Therefore some known results are improved.
Keywords:Graph  (g  f)-factors  Orthogonal factorization
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号