Enumeration of disjoint Hamilton cycles in a divisor Cayley graph

Levaku Madhavi1and Tekuri Chalapathi2*

doi:10.26637/MJM0603/0006

Enumeration of disjoint Hamilton cycles in a divisor Cayley graph

Authors :

Levaku Madhavi¹and Tekuri Chalapathi^2*

Author Address :

¹Department of Applied Mathematics, Yogi Vemana University, Kadapa-516003, A.P., India,
²Department of Mathematics, Sree Vidyanikethan Engineering College, Tirupati-517502, A.P., India.

*Corresponding author.

Abstract :

Hamilton cycles are cycles of largest length and triangles are cycles of smallest length in a graph. In this paper an enumeration method of determining the number of disjoint Hamilton cycles in the Divisor Cayley graph associated with the arithmetical function, namely the divisor function $d(n)$,$ngeq 1$ is presented.

Keywords :

Hamilton cycle, Outer Hamilton cycle, Symmetric set, Cayley graph, Divisor Cayley graph.

DOI :

10.26637/MJM0603/0006

Article Info :

Received : March 21, 2018; Accepted : May 30, 2018.