On hamiltonian decompositions of tensor products of graphs
-
Published:2019
Issue:1
Volume:13
Page:178-202
-
ISSN:1452-8630
-
Container-title:Applicable Analysis and Discrete Mathematics
-
language:en
-
Short-container-title:APPL ANAL DISCRETE M
Author:
Paulraja P.1,
Sampath Kumar1
Abstract
Finding a hamiltonian decomposition of G is one of the challenging problems in graph theory. We do not know for what classes of graphs G and H, their tensor product G x H is hamiltonian decomposable. In this paper, we have proved that, if G is a hamiltonian decomposable circulant graph with certain properties and H is a hamiltonian decomposable multigraph, then G x H is hamiltonian decomposable. In particular, tensor products of certain sparse hamiltonian decomposable circulant graphs are hamiltonian decomposable.
Publisher
National Library of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis