Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
檔案
- 000267632300007.pdf (936.6 KB, Adobe PDF)
日期
2009-07-28
類型
系所
期刊名稱
DISCRETE MATHEMATICS
卷期與頁次
第 309 卷第 14 期,頁 4705–4715
ISSN
0012-365X
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
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