Difference divisor graph of the finite group

Difference divisor graph of the finite group

Blog Article

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 HIGH WHEY VANILLA 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 Server 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.