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

正圆有向图中的弧不相交的Hamilton路和圈
引用本文:李瑞娟,韩婷婷.正圆有向图中的弧不相交的Hamilton路和圈[J].高校应用数学学报(A辑),2017,32(4).
作者姓名:李瑞娟  韩婷婷
作者单位:山西大学数学科学学院,山西太原,030006
基金项目:国家自然科学基金,山西省自然科学基金
摘    要:2012年,Bang-Jensen和Huang(J.Combin.Theory Ser.B.2012,102:701-714)证明了2-弧强的局部半完全有向图可以分解为两个弧不相交的强连通生成子图当且仅当D不是偶圈的二次幂,并提出了任意3-强的局部竞赛图中包含两个弧不相交的Hamilton圈的猜想.主要研究正圆有向图中的弧不相交的Hamilton路和Hamilton圈,并证明了任意3-弧强的正圆有向图中包含两个弧不相交的Hamilton圈和任意4-弧强的正圆有向图中包含一个Hamilton圈和两个Hamilton路,使得它们两两弧不相交.由于任意圆有向图一定是正圆有向图,所得结论可以推广到圆有向图中.又由于圆有向图是局部竞赛图的子图类,因此所得结论说明对局部竞赛图的子图类――圆有向图,Bang-Jensen和Huang的猜想成立.

关 键 词:正圆有向图  弧不相交  Hamilton圈  Hamilton路

Arc-disjoint Hamiltonian cycles and paths in positive-round digraphs
LI Rui-juan,HAN Ting-ting.Arc-disjoint Hamiltonian cycles and paths in positive-round digraphs[J].Applied Mathematics A Journal of Chinese Universities,2017,32(4).
Authors:LI Rui-juan  HAN Ting-ting
Abstract:In 2012, Bang-Jensen and Huang (J. Combin. Theory Ser. B. 2012, 102: 701-714) proved that every 2-arc-strong locally semicomplete digraph has two arc-disjoint strongly connected spanning subdigraphs, and conjectured that every 3-strong local tournament has two arc-disjoint hamil-tonian cycles. In this paper, the arc-disjoint hamiltonian paths and cycles in positive-round digraphs are discussed, and the following results are proved: every 3-arc-strong positive-round digraph contains two arc-disjoint hamiltonian cycles and every 4-arc-strong positive-round digraph contains one hamil-tonian cycle and two hamiltonian paths, such that they are arc-disjoint pairwise. A round digraph must be positive-round, thus those conclusions on positive-round digraphs can be generalized to round digraphs. Since round digraphs form the subclass of local tournaments, Bang-Jensen and Huang's conjecture holds for round digraphs which is the subclass of local tournaments.
Keywords:positive-round digraph  arc-disjoint  Hamiltonian cycle  Hamiltonian path
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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