ON HAMILTONIAN DECOMPOSITIONS OF TENSOR PRODUCTS OF GRAPHS

Applicable Analysis and Discrete Mathematics

article

P. Paulraja¹  S. Sampath Kumar² 

[1] Department of Mathematics Annamalai University Annamalainagar-608002 India.;Department of Mathematics SSN College of Engineering Kalavakkam-603110 India.

关键词: Hamilton Cycle Decomposition;    Tensor Product of Graphs;    Cayley graphs;   

DOI  :  10.2298/AADM170803003P

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Beogradu * Elektrotehnicki Fakultet / University of Belgrade, Faculty of Electrical Engineering

【 摘 要 】

Finding a hamiltonian decomposition of G is one of the challenging problemsin graph theory. We do not know for what classes of graphs G and H, theirtensor product G × H is hamiltonian decomposable. In this paper, we haveproved that, if G is a hamiltonian decomposable circulant graph with certainproperties and H is a hamiltonian decomposable multigraph, then G × H ishamiltonian decomposable. In particular, tensor products of certain sparsehamiltonian decomposable circulant graphs are hamiltonian decomposable.

【 授权许可】

Unknown