期刊文献+

(g,f)-FACTORIZATIONS OF GRAPHS ORTHOGONAL TO [1,2]-SUBGRAPH

(g,f)-FACTORIZAfIONS OF GRAPHS ORTHOGONAL TO [1,2]-SUBGRAPH
全文增补中
导出
摘要 et G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(C) with j(x)≥g(x)≥1 for all x∈V(G). It is proved that if G is an (mg+m-1, m-m+1)-graph andH is a [1,2]-subgraph with m edges, then there exists a (g,i)-factorization of G orthogonal to H. et G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(C) with j(x)≥g(x)≥1 for all x∈V(G). It is proved that if G is an (mg+m-1, m-m+1)-graph andH is a [1,2]-subgraph with m edges, then there exists a (g,i)-factorization of G orthogonal to H.
作者 阎桂英
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1997年第4期371-375,共6页 应用数学学报(英文版)
关键词 GRAPH FACTORIZATION orthogonasl Graph, factorization, orthogonasl
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部