On Hamilton Cycle Decompositions of Tensor Products of Graphs
Combinatorics
2017-03-10 v1
Abstract
A Hamiltonian decomposition of is a partition of its edge set into disjoint Hamilton cycles. Manikandan and Paulraja conjectured that if and are Hamilton cycle decomposable circulant graphs with at least one of them is nonbipartite, then their tensor product is Hamilton cycle decomposable. In this paper, we have proved that, if is a Hamilton cycle decomposable circulant graph with certain properties and is a Hamilton cycle decomposable multigraph, then their tensor product is Hamilton cycle decomposable. In particular, tensor products of certain sparse Hamilton cycle decomposable circulant graphs are Hamilton cycle decomposable.
Cite
@article{arxiv.1703.03148,
title = {On Hamilton Cycle Decompositions of Tensor Products of Graphs},
author = {P. Paulraja and S. Sampath Kumar},
journal= {arXiv preprint arXiv:1703.03148},
year = {2017}
}
Comments
24 pages, 13 figures