期刊文献+

(g, f)-factorizations orthogonal to a star in graphs 被引量:5

(g, f)-factorizations orthogonal to a star in graphs
原文传递
导出
摘要 Let G be a graph, and F={F1, F2,…,Fm} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with Fi for all i, 1≤i≤m, then we say that F is orthogonal to H. Let g and f be two integer-valued functions defined on V(G) such that 0≤g(x)≤f(x) for every x∈V(G). In this paper, it is proved that for any given star with m edges of an (mg+m-1, mf-m + 1)-graph G, there exists a (g,f)-factorization of G orthogonal to it. Let G be a graph, and F={F1, F2,…,Fm} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with Fi for all i, 1≤i≤m, then we say that F is orthogonal to H. Let g and f be two integer-valued functions defined on V(G) such that 0≤g(x)≤f(x) for every x∈V(G). In this paper, it is proved that for any given star with m edges of an (mg+m-1, mf-m + 1)-graph G, there exists a (g,f)-factorization of G orthogonal to it.
作者 刘桂真
出处 《Science China Mathematics》 SCIE 1995年第7期805-812,共8页 中国科学:数学(英文版)
基金 the Mathematics Tianyuan Foundation and Doctoral Discipline Foundation
关键词 GRAPH factor STAR ORTHOGONAL factorization. graph, factor, star, orthogonal factorization.
  • 相关文献

同被引文献11

引证文献5

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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