Contents

Ars Combinatoria

  • Research article

Maximum Packing of \(D_t-P\) and \(D_t\cup{P}\) with Mendelsohn Triples

Liqun Pu1, Hung-Lin Fu2, Hao Shen3
1Department of Mathematics, Zhengzhou University, Henan, China 450052
2Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, Taiwan 30050
3Department of Applied Mathematics, Shanghai Jiao Tong University Shanghai, China 200240
  • Published: 30/04/2009

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\cup{P}\) with Mendelsohn triples are obtained respectively, where \(P\) is a vertex-disjoint union of directed cycles in \(D_t\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Liqun Pu, Hung-Lin Fu, Hao Shen. Maximum Packing of \(D_t-P\) and \(D_t\cup{P}\) with Mendelsohn Triples[J], Ars Combinatoria, Volume 091. 165-182. .