Author(s)

Guixin Deng, Pingzhi Yuan

.

For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H = {0,1,2,···, n – 1} and there is a directed edge from a ∈ H to b ∈ H if a ≡ b(mod n). The digraph G(n,k) is symmetric if its connected component can be partitioned into isomorphic pairs. In this paper we obtain all symmetric G(n,k)

Congruence, Digraph, Component, Height, Cycle

G. Deng and P. Yuan, "Symmetric Digraphs from Powers Modulo n," Open Journal of Discrete Mathematics, Vol. 1 No. 3, 2011, pp. 103-107. doi: 10.4236/ojdm.2011.13013.