Geodesic
Properties of digraphs connected with some congruence relations
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 39-49 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of number theory with graph theory}, Czech. Math. J. 54 (129) (2004), 465--485 (see [5]). For each positive integer $n$ define a digraph $\Gamma (n)$ whose set of vertices is the set $H=\{0,1,\dots ,n - 1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^3\equiv b\pmod n.$ The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph $\Gamma (n)$ is proved. The formula for the number of fixed points of $\Gamma (n)$ is established. Moreover, some connection of the length of cycles with the Carmichael $\lambda $-function is presented.
The paper extends the results given by M. Křížek and L. Somer, {\it On a connection of number theory with graph theory}, Czech. Math. J. 54 (129) (2004), 465--485 (see [5]). For each positive integer $n$ define a digraph $\Gamma (n)$ whose set of vertices is the set $H=\{0,1,\dots ,n - 1\}$ and for which there is a directed edge from $a\in H$ to $b\in H$ if $a^3\equiv b\pmod n.$ The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph $\Gamma (n)$ is proved. The formula for the number of fixed points of $\Gamma (n)$ is established. Moreover, some connection of the length of cycles with the Carmichael $\lambda $-function is presented.
Classification : 05C20, 05C25, 11A15, 20K01
Keywords: digraphs; Chinese remainder theorem; Carmichael $\lambda $-function; group theory 
@article{CMJ_2009_59_1_a2,
     author = {Skowronek-Kazi\'ow, J.},
     title = {Properties of digraphs connected with some congruence relations},
     journal = {Czechoslovak Mathematical Journal},
     pages = {39--49},
     year = {2009},
     volume = {59},
     number = {1},
     mrnumber = {2486614},
     zbl = {1221.05183},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a2/}
}
TY  - JOUR
AU  - Skowronek-Kaziów, J.
TI  - Properties of digraphs connected with some congruence relations
JO  - Czechoslovak Mathematical Journal
PY  - 2009
SP  - 39
EP  - 49
VL  - 59
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a2/
LA  - en
ID  - CMJ_2009_59_1_a2
ER  - 
%0 Journal Article
%A Skowronek-Kaziów, J.
%T Properties of digraphs connected with some congruence relations
%J Czechoslovak Mathematical Journal
%D 2009
%P 39-49
%V 59
%N 1
%U http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a2/
%G en
%F CMJ_2009_59_1_a2
Skowronek-Kaziów, J. Properties of digraphs connected with some congruence relations. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 39-49. http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a2/

[1] Bryant, S.: Groups, graphs and Fermat's last theorem. Amer. Math. Monthly 74 (1967), 152-156. | DOI | MR | Zbl

[2] Carmichael, R. D.: Note on a new number theory function. Bull. Amer. Math. Soc. 16 (1910), 232-238 \JFM 41.0226.04. | DOI | MR

[3] Chassé, G.: Combinatorial cycles of a polynomial map over a commutative field. Discrete Math. 61 (1986), 21-26. | DOI | MR

[4] Harary, F.: Graph Theory. Addison-Wesley Publ. Company, London (1969). | MR | Zbl

[5] Křížek, M., Somer, L.: On a connection of number theory with graph theory. Czech. Math. J. 54 (2004), 465-485. | DOI | MR

[6] Křížek, M., Luca, F., Somer, L.: 17 Lectures on the Fermat Numbers. From Number Theory to Geometry. Springer-Verlag, New York (2001). | MR

[7] Rogers, T. D.: The graph of the square mapping on the prime fields. Discrete Math. 148 (1996), 317-324. | DOI | MR | Zbl

[8] Sierpiński, W.: Elementary Theory of Numbers. North-Holland (1988). | MR

[9] Szalay, L.: A discrete iteration in number theory. BDTF Tud. Közl. 8 (1992), 71-91 Hungarian. | Zbl