节点文献
完全对称有向图D_n的偶长圈分解
Cycle decomposition of symmetric complete directed graphs
【摘要】 证明了将奇数阶完全对称有向图Dn分拆为偶长有向圈的必要条件也是充分的.
【Abstract】 This paper shows that the necessary conditions of decomposing the symmetric complete directed graphs of odd order into directed even cycles are sufficient.
【关键词】 Mendelsohn设计;
圈;
差路;
差圈;
Cayley图;
【Key words】 Mendelsohn design; cycle; difference path; difference cycle; Cayley graph;
【Key words】 Mendelsohn design; cycle; difference path; difference cycle; Cayley graph;
- 【文献出处】 高校应用数学学报A辑(中文版) ,Applied Mathematics A Journal of Chinese Universities , 编辑部邮箱 ,2003年01期
- 【分类号】O157.5
- 【被引频次】1
- 【下载频次】59