TITLE:
Symmetric Digraphs from Powers Modulo n
AUTHORS:
Guixin Deng, Pingzhi Yuan
KEYWORDS:
Congruence, Digraph, Component, Height, Cycle
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.1 No.3,
October
17,
2011
ABSTRACT: 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)