Displaying similar documents to “On iteration digraph and zero-divisor graph of the ring ℤ n ”

Properties of digraphs connected with some congruence relations

J. Skowronek-Kaziów (2009)

Czechoslovak Mathematical Journal

Similarity:

The paper extends the results given by M. Křížek and L. Somer, , Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer n define a digraph Γ ( n ) whose set of vertices is the set H = { 0 , 1 , ⋯ , n - 1 } and for which there is a directed edge from a ∈ H to b ∈ H if a 3 ≡ b ( mod n ) . The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph Γ ( n ) is proved. The formula for the number of fixed points of Γ ( n ) is established. Moreover, some connection of the length...

The cubic mapping graph for the ring of Gaussian integers modulo n

Yangjiang Wei, Jizhu Nan, Gaohua Tang (2011)

Czechoslovak Mathematical Journal

Similarity:

The article studies the cubic mapping graph Γ ( n ) of ℤ n [ i ] , the ring of Gaussian integers modulo n . For each positive integer n > 1 , the number of fixed points and the in-degree of the elements 1 ¯ and 0 ¯ in Γ ( n ) are found. Moreover, complete characterizations in terms of n are given in which Γ 2 ( n ) is semiregular, where Γ 2 ( n ) is induced by all the zero-divisors of ℤ n [ i ] .

On a connection of number theory with graph theory

Lawrence Somer, Michal Křížek (2004)

Czechoslovak Mathematical Journal

Similarity:

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 a 2 ≡ b ( m o d 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 introduced.