| （m,n,k,1）偶图G—设计（K≤4） |
| |
| 引用本文： | 王建. （m,n,k,1）偶图G—设计（K≤4）[J]. 南通职业大学学报, 1999, 13(4): 37-39 |
| |
| 作者姓名： | 王建 |
| |
| 作者单位： | 南通职业大学基础课部!226007 |
| |
| 摘 要： | 本文归划讨论了当图G是点不多于4的小图时，(m,n,k,1)偶图G-设计及可分解的（m,n,k,1）偶图G-设计存在的充分必要条件。
|
| 关 键 词： | 完全偶图 偶图G－设计 可分解 充分必要条件 |
On Bipartite G-Designs (Where G has four vertices or less) |
| |
| Wang Jian. On Bipartite G-Designs (Where G has four vertices or less)[J]. Journal of Nantong Vocational College, 1999, 13(4): 37-39 |
| |
| Authors: | Wang Jian |
| |
| Abstract: | Ths is a survey on the existence of (m, n, k, 1 ) bipartite G- designs and dissociable(m, n, k, 1) bipartite G-designs, where G has four vertices or less. |
| |
| Keywords: | Complete Bipartite Graph Bipartite G - design Dissociable Bipartite G-design |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
