Symmetric Digraphs from Powers Modulo n

@article{Deng2011SymmetricDF,
  title={Symmetric Digraphs from Powers Modulo n},
  author={Guixin Deng and Pingzhi Yuan},
  journal={Open journal of Discrete Mathematics},
  year={2011},
  volume={01},
  pages={103-107}
}
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) 
2 Citations
On the symmetric digraphs from the kth power mapping on finite commutative rings
TLDR
If the characteristic of R is a prime p, the digraph G(R, k) is called symmetric of order M if its set of connected components can be partitioned into subsets of size M with each subset containing M isomorphic components. Expand
On Simple Graphs Arising from Exponential Congruences
TLDR
It is proved that the component of the simple graph is a tree with root at zero, and if is a Fermat's prime, then the components of thesimple graph is complete. Expand

References

SHOWING 1-8 OF 8 REFERENCES
On symmetric digraphs of the congruence xk = y (mod n)
TLDR
This work generalizes earlier theorems by Szalay, Carlip, and Mincheva on symmetric digraphs G(n,2) of order 2 to symmetricDigraphs M of order M when k>=2 is arbitrary. Expand
On a Connection of Number Theory with Graph Theory
We assign to each positive integer n a digraph whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a2 ≡ b (mod n). We establish necessary andExpand
Structure of digraphs associated with quadratic congruences with composite moduli
We assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,...,n-1} and for which there exists a directed edge from a@?H to b@?H if a^2=b(modn). Associated with G(n) are twoExpand
The graph of the square mapping on the prime fields
TLDR
The number of components c ( p ) (called the connectivity of the prime p ) is shown to take on certain values, assuming various hypotheses, and a formula is given for the decomposition of the graph into cyclic components and their attached trees. Expand
Symmetry of iteration graphs
We examine iteration graphs of the squaring function on the rings ℤ/nℤ when n = 2kp, for p a Fermat prime. We describe several invariants associated to these graphs and use them to prove that theExpand
On the cycle structure of repeated exponentiation modulo a prime
Abstract In a recent work, Shallit and Vasiga have obtained several results about tails and cycles in orbits of repeated squaring. Some of these results have been based on the Extended RiemannExpand
An Introduction to the Theory of Numbers
This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,Expand