On the uniqueness of the factorization of power digraphs modulo n

For each pair of integers n = Pi i=1(r) P-i(ei) and k >= 2, a digraph G(n , k) is one with vertex set {0, 1, . . . , n - 1} and for which there exists a directed edge from x to y if x(k) y (mod n). Using the Chinese Remainder Theorem, the digraph G(n , k) can be written as a direct product of digraphs G(P-i(ei), k) for all i such that 1 <= i <= r. A fundamental constituent G(P)* (n, k), where P subset of Q = {P-1, p(2), . . . , p(r)}, is a subdigraph of G(n, k) induced on the set of vertices which are multiples of Pi(pi) (is an element of P) p(i) and are relatively prime to all primes p(j) is an element of Q \ P. In this paper, we investigate the uniqueness of the factorization of trees attached to cycle vertices of the type 0, 1, and (1, 0), and in general, the uniqueness of G(n, k). Moreover, we provide a necessary and sufficient condition for the isomorphism of the fundamental constituents G(P)* (n, k(1)) and G(P)* (n, k(2)) of G(n,k(1)) and G(n, k(2)) respectively for k(1) not equal k2.