Contents

Ars Combinatoria

  • Research article

Packing and Covering \(\lambda\)-Fold Complete Symmetric Digraphs with \(6\)-Circuits

Jeng-Jong Lin1
1Ling Tung University, Taichung 408, Taiwan
  • Published: 31/01/2016

Abstract

In this paper we give the solutions of finding maximum packings and minimum coverings of \(\lambda\)-fold complete symmetric digraphs with \(6\)-circuits.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Jeng-Jong Lin. Packing and Covering \(\lambda\)-Fold Complete Symmetric Digraphs with \(6\)-Circuits[J], Ars Combinatoria, Volume 124. 229-238. .