Premium
Hamilton cycle decomposition of 6‐regular circulants of odd order
Author(s) -
Dean Matthew
Publication year - 2007
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20118
Subject(s) - circulant matrix , mathematics , combinatorics , circulant graph , vertex (graph theory) , order (exchange) , hamiltonian path , graph , discrete mathematics , line graph , voltage graph , economics , finance
The circulant G = C( n , S ), where $S\subseteq Z_n\setminus\{0\}$ , is the graph with vertex set Z n and edge set $E(G)= \{\{x,x+s\}|x \in Z_n,s \in S\}$ . It is shown that for n odd, every 6‐regular connected circulant C( n , S ) is decomposable into Hamilton cycles. © 2006 Wiley Periodicals, Inc. J Combin Designs
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom