Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps

被引:3
|
作者
Bogdanowicz, Zbigniew R. [1 ]
机构
[1] Armament Res, Ctr Dev & Engn, Picatinny Arsenal, NJ 07806 USA
关键词
Hamilton cycle; Circulant; Cayley digraph; Arc-disjoint cycle; Edge-disjoint cycle; CAYLEY-GRAPHS; DIGRAPHS;
D O I
10.1007/s00373-011-1107-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper we give new necessary and sufficient conditions for a directed circulant with vertices of outdegree two to have a pair of arc-disjoint Hamilton cycles. These conditions explicitly identify a pair of arc-disjoint Hamilton cycles if such cycles exist. In addition, we give necessary and sufficient conditions for an undirected circulant with vertices of degree four to have a specific pair of edge-disjoint Hamilton cycles.
引用
收藏
页码:165 / 171
页数:7
相关论文
共 50 条
  • [41] On the Embedding of Edge-Disjoint Hamiltonian Cycles in Transposition Networks
    Hung, Ruo-Wei
    Chih, Hao-Yu
    Hou, Chien-Hui
    [J]. 2014 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE, ELECTRONICS AND ELECTRICAL ENGINEERING (ISEEE), VOLS 1-3, 2014, : 102 - 107
  • [42] Two edge-disjoint paths with length constraints
    Cai, Leizhen
    Ye, Junjie
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 795 : 275 - 284
  • [43] TWO EDGE-DISJOINT HAMILTONIAN CYCLES IN AN ORE-TYPE-(2), GRAPH
    吴正声
    [J]. Science Bulletin, 1986, (19) : 1363 - 1364
  • [44] Arc-disjoint paths in expander digraphs
    Bohman, T
    Frieze, A
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 558 - 567
  • [45] Arc-disjoint paths in expander digraphs
    Bohman, T
    Frieze, A
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (02) : 326 - 344
  • [46] Edge-disjoint odd cycles in 4-edge-connected graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 12 - 27
  • [47] Arc-Disjoint Paths in Decomposable Digraphs
    Bang-Jensen, Jorgen
    Maddaloni, Alessandro
    [J]. JOURNAL OF GRAPH THEORY, 2014, 77 (02) : 89 - 110
  • [48] Edge-disjoint Odd Cycles in 4-edge-connected Graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    [J]. 29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 206 - 217
  • [49] A PARALLEL ALGORITHM FOR EDGE-COLORING OF GRAPHS WITH EDGE-DISJOINT CYCLES
    ALBACEA, EA
    [J]. INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 309 - 314
  • [50] EDGE-DISJOINT PACKINS OF GRAPHS
    CORNEIL, DG
    MASUYAMA, S
    HAKIMI, SL
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 50 (02) : 135 - 148