On Hamilton cycle decomposition of 6-regular circulant graphs
Data(s) |
01/11/2006
|
---|---|
Resumo |
The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer Tokyo |
Palavras-Chave | #Hamilton #cycle #decomposition #CX #0802 Computation Theory and Mathematics |
Tipo |
Journal Article |