Maximum packing of dt - p and dtu p with mendelsohn triples

Ligun Pu; Hung-Lin Fu; Hao Shen

Maximum packing of d_t - p and dtu p with mendelsohn triples

Ligun Pu^*, Hung-Lin Fu, Hao Shen

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples [6]. 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.

Original language	English
Pages (from-to)	165-182
Number of pages	18
Journal	Ars Combinatoria
Volume	91
State	Published - 1 Apr 2009

Keywords

Complete digraph
Maximum packing
Mendelsohn triples

Fingerprint Dive into the research topics of 'Maximum packing of d<sub>t</sub> - p and dtu p with mendelsohn triples'. Together they form a unique fingerprint.

Cite this

@article{6f3ad9ceda71431f860fe5387ccb2dd8,

title = "Maximum packing of dt - p and dtu p with mendelsohn triples",

abstract = "In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples [6]. 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.",

keywords = "Complete digraph, Maximum packing, Mendelsohn triples",

author = "Ligun Pu and Hung-Lin Fu and Hao Shen",

year = "2009",

month = apr,

day = "1",

language = "English",

volume = "91",

pages = "165--182",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Maximum packing of dt - p and dtu p with mendelsohn triples

AU - Pu, Ligun

AU - Fu, Hung-Lin

AU - Shen, Hao

PY - 2009/4/1

Y1 - 2009/4/1

N2 - In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples [6]. 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.

AB - In this paper, we extend the study on packing and covering of complete directed graph Dt with Mendelsohn triples [6]. 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.

KW - Complete digraph

KW - Maximum packing

KW - Mendelsohn triples

UR - http://www.scopus.com/inward/record.url?scp=67149094989&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:67149094989

VL - 91

SP - 165

EP - 182

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -

Maximum packing of dt - p and dtu p with mendelsohn triples

Abstract

Keywords

Other files and links

Cite this

Maximum packing of d_t - p and dtu p with mendelsohn triples