On K_(1,k)-factorization of bipartite multigraphs |
| |
作者单位: | WANG Jian Nantong Vocational College,Nantong 226007,China. |
| |
摘 要: | 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(k2-1)) and(4) λ(km-n)(kn-m) ≡ 0(mod k(k -1)(k2 -1)(m n)).
|
关 键 词: | 因数分解 约数 双向重图 偏微分方程 |
On K1,k-factorization of bipartite multigraphs |
| |
Authors: | WANG Jian |
| |
Institution: | Nantong Vocational College, Nantong 226007, China |
| |
Abstract: | |
| |
Keywords: | factor factorization bipartite multigraph |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
|