摘要
针对圆有向图的(1,2)步竞争图的结构,提出了竞争图中是否存在哈密尔顿圈;通过特殊到一般的方法得到如下结论:对于阶数n(n≥5)的强连通圆有向图的(1,2)步竞争图中存在哈密尔顿圈,而其余情形的圆有向图的(1,2)步竞争图中则不存在哈密尔顿圈。
With regard to the（ 1,2） step competition graph structure of round digraph,this paper puts forward whether the（ 1,2） step competition graph of round directed graph contains Hamilton cycle,and through special to general method,receives the following conclusion： Hamilton cycle is contained in order of strongly connected directed graph of the（ 1,2） step competition graph,and the rest of the situation of round digraph（ 1,2）step competition graphs does not contain Hamilton cycle.
出处
《重庆工商大学学报（自然科学版）》
2017年第6期23-28,共6页
Journal of Chongqing Technology and Business University:Natural Science Edition
