Enumeration of Triangles and Hamiltonian Property of The Zero-Divisor Cayley Graph of The Ring G(Zₙ,⊕,⊙)

Abstract

In this paper an enumeration method to find the number of triangles in the zero-divisor Cayley graph G(Zₙ,D₀ ) associated with the ring (Zₙ,⨁,⨀),n≥1 of integers modulo n, an integer and its subset D0 of zero-divisors is presented. Further it is shown that this graph is Hamiltonian, not bipartite and Eulerian graph when n is odd.