Packings and coverings of λKv by k-circu
✍
Qingde Kang; Yanfang Zhang; Huijuan Zuo
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 322 KB
Let Kv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by edges {x; y}. Let G be a ÿnite simple graph. A G-packing design (G-covering design) of Kv, denoted by (v; G; )-PD ((v; G; )-CD) is a pair (X; B), where X is the vertex set of Kv and B is a collec