首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
Authors:Liqun Pu  Hung-Lin Fu
Institution:a Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China
b Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, 30050, Taiwan
c Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, China
Abstract:Let G be a vertex-disjoint union of directed cycles in the complete directed graph Dt, let |E(G)| be the number of directed edges of G and suppose View the MathML source or View the MathML source if t=5, and View the MathML source if t=6. It is proved in this paper that for each positive integer t, there exist View the MathML source-decompositions for DtG if and only if View the MathML source.
Keywords:Mendelsohn triples  Complete directed graph  Packing
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号