Difference divisor graph of the finite group

Abstract

Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that two distinct vertices are adjacent if and only if either a-b belongs to Dn or b-a belongs to Dn . We have investigated its algebraic and graph theoretic properties. Further, we have proved that the difference divisor graph Diff (Zn, Dn) is not a Cayley graph.

Keywords

• divisor graph
• difference divisor graph
• hamilton cycle
• gcd-graph
• cayley graph