Symmetric Hamilton Cycle Decompositions of Complete Multigraphs

V. Chitra, and A. Muthusamy. "Symmetric Hamilton Cycle Decompositions of Complete Multigraphs." Discussiones Mathematicae Graph Theory 33.4 (2013): 695-707. <http://eudml.org/doc/267866>.

@article{V2013,
abstract = {Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition of ⋋Kn (respectively, ⋋Kn − F, where F is a 1-factor of ⋋Kn) which exist if and only if ⋋(n − 1) is even (respectively, ⋋(n − 1) is odd), except the non-existence cases n ≡ 0 or 6 (mod 8) when ⋋ = 1},
author = {V. Chitra, A. Muthusamy},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {complete multigraph; 1-factor; symmetric Hamilton cycle; decomposition.; decomposition},
language = {eng},
number = {4},
pages = {695-707},
title = {Symmetric Hamilton Cycle Decompositions of Complete Multigraphs},
url = {http://eudml.org/doc/267866},
volume = {33},
year = {2013},
}

TY - JOUR
AU - V. Chitra
AU - A. Muthusamy
TI - Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
JO - Discussiones Mathematicae Graph Theory
PY - 2013
VL - 33
IS - 4
SP - 695
EP - 707
AB - Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition of ⋋Kn (respectively, ⋋Kn − F, where F is a 1-factor of ⋋Kn) which exist if and only if ⋋(n − 1) is even (respectively, ⋋(n − 1) is odd), except the non-existence cases n ≡ 0 or 6 (mod 8) when ⋋ = 1
LA - eng
KW - complete multigraph; 1-factor; symmetric Hamilton cycle; decomposition.; decomposition
UR - http://eudml.org/doc/267866
ER -