# On symmetric digraphs of the congruence xk = y (mod n)

@article{Somer2009OnSD, title={On symmetric digraphs of the congruence xk = y (mod n)}, author={L. Somer and M. Kr{\'i}zek}, journal={Discret. Math.}, year={2009}, volume={309}, pages={1999-2009} }

We assign to each pair of positive integers n and k>=2 a digraph G(n,k) 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 a^k=b(modn). The digraph G(n,k) is symmetric of order M if its set of components can be partitioned into subsets of size M with each subset containing M isomorphic components. We generalize earlier theorems by Szalay, Carlip, and Mincheva on symmetric digraphs G(n,2) of order 2 to symmetric digraphs G(n,k) of order M when k… Expand

#### Topics from this paper

#### 28 Citations

On the symmetric digraphs from powers modulo n

- Computer Science, Mathematics
- Discret. Math.
- 2012

On the symmetric digraphs from the kth power mapping on finite commutative rings

- Mathematics, Computer Science
- Discret. Math. Algorithms Appl.
- 2015

The digraph of the kth power mapping of the quotient ring of polynomials over finite fields

- Computer Science, Mathematics
- Finite Fields Their Appl.
- 2012

#### References

SHOWING 1-5 OF 5 REFERENCES

Structure of digraphs associated with quadratic congruences with composite moduli

- Computer Science, Mathematics
- Discret. Math.
- 2006