Hamilton cycle decomposition of 6-regular circulants of odd order

Dean, M (2007) Hamilton cycle decomposition of 6-regular circulants of odd order. Journal of Combinatorial Designs, 15 2: 91-97. doi:10.1002/jcd.20118

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Dean, M
Title Hamilton cycle decomposition of 6-regular circulants of odd order
Journal name Journal of Combinatorial Designs   Check publisher's open access policy
ISSN 1063-8539
Publication date 2007
Sub-type Article (original research)
DOI 10.1002/jcd.20118
Volume 15
Issue 2
Start page 91
End page 97
Total pages 7
Place of publication Hoboken
Publisher John Wiley & Sons Inc
Language eng
Abstract The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge set E(G) = {{x, x + s} vertical bar x is an element of Z(n), s is an element of s}. It is shown that for n odd, every 6-regular connected circulant C(n, S) is decomposable into Hamilton cycles. (c) 2006 Wiley Periodicals, Inc.
Keyword Mathematics
Hamilton cycle decomposition
circulant
graph decomposition
graph factorization
Cayley-graphs
Abelian-groups
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collections: Excellence in Research Australia (ERA) - Collection
School of Mathematics and Physics
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 7 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 12 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Mon, 18 Feb 2008, 16:20:43 EST