In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples . Mainly, the maximum packing of Dt - P and DtUP with Mendelsohn triples are obtained respectively where P is a vertex-disjoint union of directed cycles in Dt.
|Number of pages||18|
|State||Published - 1 Apr 2009|
- Complete digraph
- Maximum packing
- Mendelsohn triples