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


Existence of 1-Rotational k-Cycle Systems of the Complete Graph
Authors:Marco?Buratti  author-information"  >  author-information__contact u-icon-before"  >  mailto:buratti@mat.uniroma.it"   title="  buratti@mat.uniroma.it"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Dipartimento di Matematica e Informatica, Università di Perugia, Via Vanvitelli 1, 06123 Perugia, Italy
Abstract:We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph Kv with vequiv1 or k (mod 2k). For vequiv1 (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and vequivk (mod 2k), (except kequiv3 and vequiv15, 21 (mod 24)) a 1-rotational k-cycle system of Kv exists.Final version received: June 18, 2003
Keywords:(1-Rotational) k-cycle system  (Hooked) Skolem sequence
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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