| 完全二部多重图的K2,3-因子分解 |
| |
| 引用本文： | 朱莉,王建. 完全二部多重图的K2,3-因子分解[J]. 大学数学, 2011, 27(3): 70-74 |
| |
| 作者姓名： | 朱莉 王建 |
| |
| 作者单位： | 南通职业大学,基础部,江苏,南通,226007 |
| |
| 基金项目： | 江苏省高校自然科学基金资助项目(04KJD110152) |
| |
| 摘 要： | 如果完全二部多重图λK<,m,n>的边集可以划分为λK<,m,n>的K<,p,q>-因子,则称λK<,m,n>存在K<,p,q>-因子分解.当p=1和q=2时,λK<,m,n>的K<,1,2>-因子分解的存在性问题已被完全解决.最近我们得到了当λ=1时,K<,m,n>存在K<,2,3>-因子分解的充分必要条件.对于任意...
|
| 关 键 词： | 二部多重图 因子 因子分解 |
K_(2,3)-factorization of Complete Bipartite Multigraphs |
| |
| ZHU Li,WANG Jian. K_(2,3)-factorization of Complete Bipartite Multigraphs[J]. College Mathematics, 2011, 27(3): 70-74 |
| |
| Authors: | ZHU Li WANG Jian |
| |
| Affiliation: | ZHU Li,WANG Jian(Nantong Vocational College,Nantong 226007,China) |
| |
| Abstract: | Let lKm,n be a complete bipartite multigraph with two partite sets having mand nvertices,respectively.A Kp,q-factorization of lKm,n is a set of edge-disjoint Kp,q-factors of lKm,n.When p=1 and q=2,the K1,2-factorization of lKm,n has been completely solved.Recently,we gave a necessary and sufficient condition for K2,3-factorization of Km,n.In this article,we will give a necessary and sufficient condition for K2,3-factorization of lKm,n is that(i) 2m≤3n,(ii) 2n≤3m,(iii)m+n≡0(mod 5) and(iv) 5lmn/[6(m+n)]is aninteger. |
| |
| Keywords: | complete bipartite multigraphs factor factorization |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
