Packings and Coverings of λK_v with 2 Graphs of 6 Vertices and 7 Edges

作     者：Yan Ke DU Qing De KANG 

作者机构：Institute of Applied Mathematics Mechanical Engineering College Hebei 050003 P. R. China Institute of Mathematics Hebei Normal University Hebei 050016 P. R. China 

出 版 物：《Journal of Mathematical Research and Exposition》 (数学研究与评论（英文版）)

年 卷 期：2011年第31卷第1期

页      面：59-66页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (Grant No.10671055) 

主　　题：G-design G-packing design G-covering design. 

摘      要：A maximum （v, G, λ）-PD and a minimum （v, G, λ）-CD axe studied for 2 graphs of 6 vertices and 7 edges. By means of ＂difference method＂ and ＂holey graph design＂, we obtain the result： there exists a （v, Gi, λ）-OPD （OCD） for v ≡ 2, 3, 4, 5, 6 （mod 7）, λ ≥ 1, i = 1, 2.