Letn ≡ k−1, 0 or 1 (mod k).An R̃MP(k, ; n,m) (resp. R̃MC(k, ; n,m)) is a resolvable packing (resp. covering)withmaximum (resp. minimum) possible number m of parallel classes which are mutually distinct, each parallel class consists of (n− k + 1)/k blocks of size k and one block of size n− k (n− k+ 1)/k , and its leave (resp. excess) is a simple graph. Such designs can be used to construct certain...
