...
首页> 外文期刊>Discrete mathematics >Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
【24h】

Hamilton cycles in circulant digraphs with prescribed number of distinct jumps

机译:汉密尔顿在循环图上以规定的跳跃次数循环

获取原文
获取原文并翻译 | 示例
           

摘要

Let G be a digraph that consists of a finite set of vertices V(G). G is called a circulant digraph if its automorphism group contains a |V(G)|-cycle. A circulant digraph G has arcs (i, i+a_1 ), (i, i+a_2 ), ... , (i, i +a_j) (mod|V (G)|) incident to each vertex i, where integers a_ks satisfy 0 < a_1 <а_2 <a_j≤| V(G)| —1 and are called jumps. It is well known that not every G is Hamiltonian. In this paper we give sufficient conditions for a G to have a Hamilton cycle with prescribed distinct jumps, and prove that such conditions are also necessary for every G with two distinct jumps. Finally, we derive several results for obtaining G' with k, k ≥ 2 distinct jumps if the corresponding G contains a Hamilton cycle with two distinct jumps.
机译:令G为由有限的一组顶点V(G)组成的有向图。如果G的自同构基团包含| V(G)|-循环,则称G为循环图。循环图G有入射到每个顶点i的弧(i,i + a_1),(i,i + a_2),...,(i,i + a_j)(mod | V(G)|),其中整数a_ks满足0 <a_1 <а_2<a_j≤| V(G)| -1,称为跳跃。众所周知,并非每个G都是哈密顿量。在本文中,我们为G具有规定的明显跳变的汉密尔顿循环提供了充分的条件,并证明对于具有两个明显跳变的每个G,此类条件也是必要的。最后,如果相应的G包含具有两个不同跳跃的汉密尔顿循环,我们将得出多个结果,以获得具有k,k≥2个不同跳跃的G'。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号