Enumeration of Triangles in a Divisor Cayley Graph

In this paper a new class of arithmetic Cayley graphs, namely, divisor Cayley graphs associated with the divisor function d ƒvnƒw , n „d1,an integer is introduced. It is shown that this graph is regular, hamiltonian, connected and not bipartite, and when n is odd it is eulerian. The enumeration of triangles in this graph is also presentedKey words: Arithmetic graph, Cayley graph, Hamilton cycle, Fundamental triangle and Triangle