期刊文献+

On K_(1,k)-factorization of bipartite multigraphs

On K_(1,k)-factorization of bipartite multigraphs
下载PDF
导出
摘要 A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that (1) m ≤ kn, (2) n ≤ km, (3) km-n = kn-m ≡ 0 (mod (k^2- 1)) and (4) λ(km-n)(kn-m) ≡ 0 (mod k(k- 1)(k^2 - 1)(m + n)). A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that (1) m ≤ kn, (2) n ≤ km, (3) km-n = kn-m ≡ 0 (mod (k^2- 1)) and (4) λ(km-n)(kn-m) ≡ 0 (mod k(k- 1)(k^2 - 1)(m + n)).
作者 WANG Jian
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2008年第3期345-350,共6页 高校应用数学学报(英文版)(B辑)
基金 the National Natural Science Foundation of China (10571133)
关键词 FACTOR FACTORIZATION bipartite multigraph factor, factorization, bipartite multigraph
  • 相关文献

参考文献1

二级参考文献4

  • 1Ushio, K., G-designs and related designs, Discrete Math.,1993,116:299-311.
  • 2Ushio, K., P3-factorization of complete bipartite graphs, DiscreteMath., 1988,72:361-366.
  • 3Wang, H., On K1,k-factorizations of a complete bipartite graph, DiscreteMath., 1994,126:359-364.
  • 4Du Beiliang, K1,p2-factorization of complete bipartitegraphs, Discrete Math., 1998,187:273-279.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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