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

作　　者：Yan Ke DU Qing De KANG 

机构地区：[1]Institute of Applied Mathematics, Mechanical Engineering College, Hebei 050003, P. R. China [2]Institute of Mathematics, Hebei Normal University, Hebei 050016, P. R. China

出　　处：《Journal of Mathematical Research and Exposition》2011年第1期59-66,共8页数学研究与评论（英文版）

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

摘　　要：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.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.

关 键 词：G-design G-packing design G-covering design. 

分 类 号：O157.2[理学—数学]