On a Connection of Number Theory with Graph Theory

@article{Somer2004OnAC,
  title={On a Connection of Number Theory with Graph Theory},
  author={L. Somer and M. Kr{\'i}zek},
  journal={Czechoslovak Mathematical Journal},
  year={2004},
  volume={54},
  pages={465-485}
}
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 and sufficient conditions for the existence of isolated fixed points. We also examine when the digraph is semiregular. Moreover, we present simple conditions for the number of components and length of cycles. Two new necessary and sufficient conditions for the compositeness of Fermat numbers are also… Expand

Figures from this paper

Properties of digraphs connected with some congruence relations
On the symmetric digraphs from powers modulo n
Structure of digraphs associated with quadratic congruences with composite moduli
On symmetric digraphs of the congruence xk = y (mod n)
Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring Z
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Combinatorial cycles of a polynomial map over a commutative field
  • G. Chassé
  • Computer Science, Mathematics
  • Discret. Math.
  • 1986
The graph of the square mapping on the prime fields
A discrete iteration in number theory
  • BDTF Tud. Közl
  • 1992
? ? ? ? f ? ? ? ? ?
17 Lectures on Fermat Numbers
A necessary and sufficient condition for the primality of Fermat
  • numbers. Math. Bohem
  • 2001
...
1
2
...