Maximum Packing of Dt-P and Dt boolean OR P with Mendelsohn Triples

Abstract

In this paper, we extend the study on packing and covering of complete directed graph D(t) with Mendelsohn triples [6]. Mainly, the maximum packing of D(t) - P and D(t) boolean OR P with Mendelsohn triples are obtained respectively where P is a vertex-disjoint union of directed cycles in D(t).