標題: Maximum Packing of Dt-P and Dt boolean OR P with Mendelsohn Triples
作者: Pu, Liqun
Fu, Hung-Lin
Shen, Hao
應用數學系
Department of Applied Mathematics
關鍵字: Mendelsohn triples;Complete digraph;Maximum Packing
公開日期: 1-Apr-2009
摘要: 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).
URI: http://hdl.handle.net/11536/7439
ISSN: 0381-7032
期刊: ARS COMBINATORIA
Volume: 91
Issue: 
起始頁: 165
結束頁: 182
Appears in Collections:Articles