Decomposition of λK v into five graphs with six vertices and eight edges

被引：0
|
作者：
Yuan, Lan-dang [1 ]
Kang, Qing-de [2 ]
机构：
[1] Hebei Normal Univ, Coll Math & Informat Sci, Shijiazhuang 050000, Peoples R China
[2] Hebei Normal Univ, Inst Math, Shijiazhuang 050000, Peoples R China
来源：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2012年 / 28卷 / 04期
基金：
中国国家自然科学基金;
关键词：
graph design; holey graph design; quasi-group;
D O I：
10.1007/s10255-012-0191-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we discuss the G-decomposition of lambda K (v) (G-GD (lambda) (v)) into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey Gdesigns, and incomplete G-designs are constructed. Finally, the spectrum of the existence of G-GD (lambda) (v) is determined.
引用
收藏
页码：823 / 832
页数：10
相关论文
共 50 条
12345