Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
4715 | en_US |
dc.citation.issue |
14 | en_US |
dc.citation.spage |
4705 | en_US |
dc.citation.volume |
309 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Pu, Liqun | en_US |
dc.contributor.author |
Fu, Hung-Lin | en_US |
dc.contributor.author |
Shen, Hao | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:09:06Z | |
dc.date.available |
2014-12-08T15:09:06Z | |
dc.date.issued |
2009-07-28 | en_US |
dc.description.abstract |
Let G be a vertex-disjoint union of directed cycles in the complete directed graph D(t), let vertical bar E(G)vertical bar be the number of directed edges of G and suppose G not equal 54 (C) over right arrow (2) boolean OR (C) over right arrow (3) or (C) over right arrow (5) if t = 5, and G not equal (C) over right arrow (3) boolean OR (C) over right arrow (3) if t = 6. It is proved in this paper that for each positive integer t, there exist (C) over right arrow (3)-decompositions for D(t) - G if and only if t(t - 1) -vertical bar E(G)vertical bar equivalent to 0 (mod 3). (C) 2008 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.disc.2008.05.039 | en_US |
dc.identifier.issn |
0012-365X | en_US |
dc.identifier.journal |
DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.disc.2008.05.039 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/6937 | |
dc.identifier.wosnumber |
WOS:000267632300007 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Mendelsohn triples | en_US |
dc.subject |
Complete directed graph | en_US |
dc.subject |
Packing | en_US |
dc.title |
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves | en_US |
dc.type |
Article | en_US |
檔案
- 000267632300007.pdf (936.6 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Pu, L., Fu, H.-L., & Shen, H. (2009). Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. DISCRETE MATHEMATICS, 309(14), 4705–4715. https://doi.org/10.1016/j.disc.2008.05.039
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6937