期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
K_(1,p)~k-FACTORIZATION OF COMPLETE BIPARTITE GRAPHS 被引量:3
1
作者 du beiliangdept.ofmath.,suzhouuniv.,suzhou215006.e-mail:dubl@pub.sz.jsinfo.ne 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2001年第2期107-110,共4页
In this paper, it is shown that a sufficient condition for the existence of a K 1,p k factorization of K m,n , whenever p is a prime number and k is a positive integer, is (1) m≤p kn,(2... In this paper, it is shown that a sufficient condition for the existence of a K 1,p k factorization of K m,n , whenever p is a prime number and k is a positive integer, is (1) m≤p kn,(2) n≤p km,(3)p kn-m≡p km-n ≡0(mod( p 2k -1 )) and (4) (p kn-m)(p km-n) ≡0(mod( p k -1)p k×(p 2k -1)(m+n)) . 展开更多
关键词 Bipartite graph FACTOR factorization.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部