2类6点7边图的填充与覆盖

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

研究了2类6点7边图的最大填充与最小覆盖.运用"差方法"、"带洞图设计"等工具,结合一系列小设计的构作,证明了存在(v,Gi,λ)-OPD(OCD)当且仅当v≡2,3,4,5,6(mod 7),λ≥1,i=1,2.

A maximum （v, G, λ ）-PD and a minimum （v, G, λ ）-CD are studied for 2 graphs of 6 vertices and 7 edges. By means of different method and holey graph design, The existence of a （ v, Gi,λ ）-OPD （OCD） when and only when v≡2,3,4,5,6（mod 7）,λ≥1,i=1,2. is proved.