Levaku Madhavi1and Tekuri Chalapathi2*
Author Address :
1Department of Applied Mathematics, Yogi Vemana University, Kadapa-516003, A.P., India,
2Department of Mathematics, Sree Vidyanikethan Engineering College, Tirupati-517502, A.P., India.
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.
Hamilton cycle, Outer Hamilton cycle, Symmetric set, Cayley graph, Divisor Cayley graph.
Article Info :
Received : March 21, 2018; Accepted : May 30, 2018.