Next Article in Journal
Extensions of Göhde and Kannan Fixed Point Theorems in Strictly Convex Banach Spaces
Previous Article in Journal
A Fractional PDE-Based Model for Nerve Impulse Transport Solved Using a Conforming Virtual Element Method: Application to Prosthetic Implants
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Domination Parameters of Unit Graphs of Rings

School of Mathematics and Statistics, Jiangxi Normal University, Nanchang 330022, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(6), 399; https://doi.org/10.3390/axioms14060399
Submission received: 27 March 2025 / Revised: 14 May 2025 / Accepted: 17 May 2025 / Published: 23 May 2025

Abstract

Let R be a finite commutative ring with nonzero identity 1. In this paper, domination parameters, the domination number and the total dominating number, of the unit graph G ( R ) or the closed unit graph G ¯ ( R ) of R are investigated. To study the domination number of G ( R ) , we prove that it suffices to consider the case when R is a direct product of fields. Furthermore, we discuss the domination number and total dominating number of the unit graph of the ring of integers modulo n.

1. Introduction

Throughout this paper, all rings are finite and commutative with nonzero identity 1, and U ( R ) and J ( R ) denote, respectively, the set of units and the Jacobson radical of a ring R. Moreover, Z n denotes the ring of integers modulo n.

1.1. Unit Graphs of Rings

Assigning a graph to a ring plays an important role in studying the structure of the ring. In 1988, Beck first introduced and studied the zero-divisor graph of a commutative ring in [1]. Since then, zero-divisor graphs, as well as many other graphs associated with rings, have been extensively studied.
With the unit of a ring being an important element of the ring, it is natural to associate a ring with a graph whose edge relationships rely on units of the ring instead of zero divisors. In 1990, Grimaldi first studied the unit graph of Z n . He reported various conclusions about the degree of a vertex, the Hamilton cycles, the covering number, the independence number, and the chromatic polynomial of the unit graph of Z n in [2]. In 2010, Ashrafi et al. promoted the unit graph G ( Z n ) to the unit graph G ( R ) for an arbitrary ring R, and reported some characterization conclusions for finite (commutative) rings regarding connectedness, chromatic index, diameter, girth, and planarity of G ( R ) in [3]. In recent years, there has been a continuous stream of research on unit graphs associated with a ring. In 2011, Maimani et al. obtained necessary and sufficient conditions for unit graphs to be Hamiltonian in [4]. In 2013, Heydari and Nikmehr studied the unit graph of a left Artinian ring in [5], and Afkhami and Khosh-Ahang investigated the unit graphs of rings of polynomials and power series in [6]. From 2014 to 2021, Su et al. investigated the unit graphs for an arbitrary ring with girth, planarity, higher genus unit graphs, diameter, and radius in [7,8,9,10,11].
Definition 1 
([12], Definitions and Remarks 2.1). Let R be a ring. The unit graph of R, denoted by G ( R ) , is the simple graph obtained by setting all the elements of R to be vertices and defining distinct vertices x and y to be adjacent if and only if x + y U ( R ) .
When omitting the words “simple" and “distinct" in the definition, we obtain a closed unit graph  G ¯ ( R ) , and this graph may have loops. Note that G ¯ ( R ) = G ( R ) if and only if 2 U ( R ) , where 2 = 1 R + 1 R , 1 R is the identity of R.
The unit graph G ( Z 3 ) and the closed unit graph G ¯ ( Z 3 ) are, respectively, described in Figure 1 and Figure 2.

1.2. The Domination Number of Unit Graphs of Rings

Definition 2 
([13]). Let G be a graph and V ( G ) be the set of its vertices. A nonempty subset S of V ( G ) is called a dominating set if every vertex in V ( G ) S is adjacent to at least one vertex in S. A subset S of V ( G ) is called a total dominating set if every vertex in V ( G ) is adjacent to some vertex in S.
The  domination number  of a graph G , denoted by γ ( G ) , is defined as the minimum cardinality of a dominating set in G , and the corresponding dominating set is called a γ -set  of G . In a similar way, the  total dominating number  of G , denoted by γ t ( G ) , is defined as the minimum cardinality of a total dominating set in G , and the corresponding dominating set is called a   γ t -set  of G .
Remark 1. 
Clearly, a total dominating set of a graph G must be a dominating set of G , so γ ( G ) γ t ( G ) .
Remark 2. 
(i) Let G be a simple graph. Then, γ t ( G ) 2 , since a is not adjacent to a in G for any a V ( G ) .
(ii) Let R be a ring. Then, γ t ( G ¯ ( R ) ) 2 , since a is not adjacent to a in G ¯ ( R ) for any a R .
In 2010, Gasper Mekis gave some characterization results for the domination number of unit graphs of rings in [14]. In 2015, Kiani et al. characterized rings with unit graphs having a domination number less than four (see Lemma 7) in [15].This conclusion allows us to determine the structures of certain rings by means of the domination number of their unit graphs.
In 2020, Su et al. investigated the domination number of G ( Z n ) when n has exactly three prime divisors in [16]. Throughout [15,16], when n has at most three prime divisors, the domination number of G ( Z n ) is calculated, but the total dominating number of G ( Z n ) and G ¯ ( Z n ) is not considered completely. In Section 3, we provide additional evidence for some remaining conditions (see Corollary 3).
In addition, let S = Z p 1 α 1 p 2 α 2 p 3 α 3 Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 , where p 1 < p 2 < p 3 are primes, α 1 , α 2 , α 3 are positive integers, and α 1 α 2 α 3 > 1 . In [16], Su et al. found a γ -set of S, and they proved that this specific γ -set of S is a total dominating set of M, so γ t ( G ( S ) ) γ ( G ( S ) ) . Using Remark 1, they obtained that γ ( G ( S ) ) = γ t ( G ( S ) . So they raised the question in [16] (Remark):
Is γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) true for all n ?
For this question, we provide four counterexamples and modify the question in Remark 11. However, in the four counterexamples, Z n is exactly a product of certain fields (i.e., | J ( Z n ) | = 1 using Remark 3). So, we modify the question as
Is γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) true when   | J ( Z n ) | > 1 ?
Furthermore, we propose a new conjecture: For a ring R, is γ ( G ( R ) ) = γ t ( G ( R ) ) true when | J ( R ) | > 1 ? By coincidence, we observed that D / J ( M ) is a total dominating set of G ( S / J ( S ) ) , where D is the γ -set of G ( S ) of [16] (see Appendix A), and J ( R ) is a special concept of R since it meets the property of Lemma 3. Naturally, this drove us to further explore the relationships between γ ( G ( R ) ) and γ t ( G ( R / J ( R ) ) ) .

1.3. Layout of the Paper

In this paper, we focus on the unit graph associated with a ring. In Section 2, we introduce some notations of graphs, rings, and unit graphs of rings.
In Section 3, we investigate the relationships between the domination number and total dominating number of unit graphs of rings, and we prove that γ ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) , where R is a ring with | J ( R ) | 2 (Theorem 1). According to this result, to study the domination number of the unit graph G ( R ) , it suffices to study the total dominating number of the unit graph associated with the semisimple ring R / J ( R ) . That is to say, it suffices to consider the cases when R is a direct product of fields using Lemma 5. In particular, to study the domination number of the unit graph of Z n , it suffices to consider the case when Z n is directly decomposed into fields.
In Section 4, we focus on studying the domination number of G ( Z n ) when n has at least four prime divisors. Let T = Z p 1 Z p 2 Z p m , where m 4 and p 1 < p 2 < < p m are primes. We find the γ -set (also a γ t -set) of G ( T ) and G ¯ ( T ) when p 1 3 and p 2 p 1 p 1 1 m , and then we obtain the domination number and total dominating number of G ( T ) and G ¯ ( T ) when p 1 3 and p 2 p 1 p 1 1 m (Theorem 2). At the same time, in Theorem 2, we provide the range of the domination number and total dominating number of G ( T ) when p 1 = 2 .
In Section 5, we provide additional properties of the domination number and total dominating number of G ( Z n ) and G ¯ ( Z n ) , and then we obtain the domination number and total dominating number when n has exactly four prime divisors (Theorem 3).

2. Preliminaries

In this section, we will review some notions about graphs and rings, and some results about unit graphs of rings, which will be used subsequently.

2.1. Some Notions of Graphs

A graph  G is an ordered triple ( V ( G ) , E ( G ) , ψ G ) consisting of a nonempty set V ( G ) of vertices, a set E ( G ) , disjoint from V ( G ) , of edges, and an incidence function ψ G that associates with each edge of G an unordered pair of (not necessarily distinct) vertices of G . If e is an edge and u and v are vertices such that ψ G ( e ) = { u , v } , then e is said to join u and v, and the vertices u and v are called the ends of e. The ends of an edge are said to be incident with the edge, and vice versa. Two vertices which are incident with a common edge are adjacent. An edge with identical ends is called a loop, and an edge with distinct ends a link. Two or more links with the same pair of ends are said to be parallel edges [17].
A graph is simple [17] if it has no loops or parallel edges. If two vertices u and v are adjacent in a graph G , then we use the usual notation u v in G , and u v means that u and v are not adjacent. Some other notions used in graph theory are listed in the following (see [17]):
  • A bipartite graph is one whose vertex set can be partitioned into two subsets X and Y, so that each edge has one end in X and one end in Y, such a partition ( X , Y ) is called a bipartition of the graph.
  • The degree  d G ( v ) of a vertex v in G is the number of edges of G incident with v, with each loop counting as two edges.
  • The open neighborhood of a vertex v in a simple graph G , denoted by N G ( v ) , is the set of all vertices of G which are adjacent to v.

2.2. Some Notions of Rings

There exist rings with exactly one maximal ideal; for example, fields. A ring with exactly one maximal ideal is called a local ring [3].
Lemma 1 
([3], Proposition 1.6). Let R be a local ring with exactly one maximal ideal M. Then, the following statements hold:
(i)
M = R U ( R ) , where U ( R )  is the set of unit elements of R.
(ii)
1 + x U ( R ) for any x M .
The Jacobson radical J ( R ) of a ring R is defined as the intersection of all the maximal ideals of R [3].
Lemma 2 
([3], Proposition 1.9). Let R be a ring. Then, J ( R ) = { x R | 1 x R U ( R ) } , where 1 x R = { 1 x r | r R } .
Lemma 3. 
Let R be a ring and a R . Then, a U ( R ) if and only if a + J ( R ) U ( R / J ( R ) ) .
Proof. 
This follows immediately from [18] (Proposition 4.8). □
Remark 3 
([15], Remark 3.15). It is known that every finite commutative ring is isomorphic to a direct product of local rings. Thus, for a given ring R, we may write R R 1 R n , where R i is a local ring with maximal ideal M i for every 1 i n . It is easy to see that
{ R 1 R i 1 M i R i + 1 R n | 1 i n }
is the set of all maximal ideals of R 1 R n and thus we conclude that the Jacobson radical of R is isomorphic to J ( R 1 R n ) = M 1 M n . Moreover,
R / J ( R ) ( R 1 R n ) / ( M 1 M n ) ( R 1 / M 1 ) ( R n / M n ) .
In particular, for the ring Z n , let n = p 1 α 1 p 2 α 2 p s α s , where p 1 < p 2 < < p s are primes and s is an integer. Then, Z n Z p 1 α 1 Z p 2 α 2 Z p s α s , where Z p 1 α 1 , , Z p s α s are local rings.
Definition 3 
([19], Page 429, Definition 2.9). A ring R is said to be (Jacobson) semisimple if its Jacobson radical J ( R ) is zero.
Lemma 4 
([19], Page 431, Theorem 2.14). If R is a ring, then R / J ( R ) is semisimple.
Definition 4 
([19], Page 372, Definition 1.1 and Definition 1.2). Let ( Σ ; ) be a poset. The descending chain condition  ( DCC ) is that every decreasing sequence I 1 I 2 in Σ is stationary (i.e., there exists n Z + such that I n = I n + 1 = ). A ring R is left [resp. right] Artinian if R satisfies the descending chain condition on left [resp. right] ideals. R is said to be Artinian if R is both left and right Artinian.
Clearly, a finite communicative ring with nonzero identity is Artinian.
Lemma 5 
([19], Page 442, Exercise 3). A commutative semisimple left Artinian ring is a direct product of fields.

2.3. Some Known Results About Unit Graphs of Rings

Lemma 6 
([15], Lemma 4.8). Let R be a ring. Then, γ ( G ( R ) ) γ t ( G ( R ) ) γ t ( G ( R / J ( R ) ) ) .
Lemma 7 
([15], Theorem 2.2). Let R be a ring. Then, the following statements hold for the unit graph G ( R ) :
(i) 
γ ( G ( R ) ) = 1 if and only if R is a field.
(ii) 
γ ( G ( R ) ) = 2 if and only if either R is a local ring which is not a field, R is isomorphic to the products of two fields such that only one of them has characteristic 2, or R Z 2 F , where F is a field.
(iii) 
γ ( G ( R ) ) = 3 if and only if R is not isomorphic to the product of two fields such that only one of them has characteristic 2, and R R 1 R 2 , where R i is a local ring with maximal ideal M i in such a way that R i / M i Z 2 , for i = 1 , 2 .
Lemma 8 
([15], Lemma 4.2). Let R be a local ring with maximal ideal M such that | R / M | = 2 and let S be a local ring. If R is not a field, then γ ( G ( R S ) ) = γ t ( G ( R S ) ) = 4 .
Lemma 9 
([15], Lemma 4.3). Let S be a local ring which is not a field. Then, γ ( G ( Z 2 S ) ) = γ t ( G ( Z 2 S ) ) = 4 .
Lemma 10 
([15], Lemma 4.5). Let F 1 and F 2 be two fields in which either both of them have characteristic 2 and none of them is isomorphic to Z 2 or none of them has characteristic 2. Then, γ ( G ( F 1 F 2 ) ) = γ t ( G ( F 1 F 2 ) ) = 3 .
Lemma 11 
([15], Lemma 3.12). Let F 1 , F 2 a n d F 3 be three fields. Then, γ ( G ( F 1 F 2 F 3 ) ) = 4 .
Lemma 12 
([15], Lemma 3.13). Let F 1 , , F k be fields. If k 3 , then γ ( G ( F 1 F k ) ) k + 1 .
Lemma 13 
([12], Proposition 2.4). Let R be a ring. Then, the following statements hold for the unit graph G ( R ) of R:
(i) 
If 2 U ( R ) , then the unit graph G ( R ) is a | U ( R ) | -regular graph.
(ii) 
If 2 U ( R ) , then for every x U ( R ) we have d G ( R ) ( x ) = | U ( R ) | 1 and for every x R U ( R ) we have d G ( R ) ( x ) = | U ( R ) | .
Corollary 1. 
Let R be a ring. Then, the following statements hold for the closed unit graph G ¯ ( R ) of R:
(i) 
If 2 U ( R ) , then G ¯ ( R ) is a | U ( R ) | -regular graph.
(ii) 
If 2 U ( R ) , then for every x U ( R ) we have d G ¯ ( R ) ( x ) = | U ( R ) | + 1 and for every x R U ( R ) we have d G ¯ ( R ) ( x ) = | U ( R ) | .
Proof. 
(i) If 2 U ( R ) , then G ( R ) = G ¯ ( R ) , so G ¯ ( R ) is a | U ( R ) | -regular graph by Lemma 13.
(ii) If 2 U ( R ) , then for every x R , we have 2 x U ( R ) if and only if x U ( R ) . Consequently, if x U ( R ) , then x x in G ¯ ( R ) , which implies that d G ¯ ( R ) ( x ) = d G ( R ) ( x ) + 2 = | U ( R ) | + 1 by Lemma 13. If x R U ( R ) , then x x in G ¯ ( R ) , and so d G ¯ ( R ) ( x ) = d G ( R ) ( x ) = | U ( R ) | by Lemma 13. □

3. The Relationships Between γ ( G ( R ) ) and γ t ( G ( R / J ( R ) ) )

In this section, we will investigate the relationships between the domination number and total dominating number of unit graphs of rings.
Lemma 14. 
Let R be a ring. Then, γ ( G ¯ ( R ) ) = γ ( G ( R ) ) .
Proof. 
Suppose that D is a dominating set of G ( R ) . Then, for any a R D , there exists x a D such that a x a in G ( R ) . Since E ( G ( R ) ) E ( G ¯ ( R ) ) , we have a x a in G ¯ ( R ) . This shows that D is a dominating set of G ¯ ( R ) , and, consequently, γ ( G ¯ ( R ) ) γ ( G ( R ) ) .
Conversely, suppose that D is a dominating set of G ¯ ( R ) . Then, for any b R D , there exists x b D such that b x b in G ¯ ( R ) . Since b D and x b D , we have b x b in G ( R ) , and so D is a dominating set of G ( R ) . Thus, γ ( G ( R ) ) γ ( G ¯ ( R ) ) , and hence γ ( G ¯ ( R ) ) = γ ( G ( R ) ) . □
In [15] (Theorem 3.20), Lemma 14 has already been pointed out, but we have not found a relevant proof, so we give a detailed proof here.
Lemma 15. 
Let R be a ring. Then, γ ( G ( R ) ) γ t ( G ¯ ( R ) ) γ t ( G ( R ) ) .
Proof. 
Suppose that D is a total dominating set of G ( R ) . Then, for any a R , there exist x a D such that a x a in G ( R ) . Since E ( G ( R ) ) E ( G ¯ ( R ) ) , we have a x a in G ¯ ( R ) , and so D is a total dominating set of G ¯ ( R ) . Thus, γ t ( G ¯ ( R ) ) γ t ( G ( R ) ) . Using Lemma 14 and Remark 1, we have γ ( G ( R ) ) γ t ( G ¯ ( R ) ) γ t ( G ( R ) ) . □
Lemma 16. 
Let R be a ring. Then, γ t ( G ¯ ( R ) ) ) γ t ( G ¯ ( R / J ( R ) ) ) .
Proof. 
Suppose that D = { x 1 + J ( R ) , , x s + J ( R ) } is a total dominating set of G ¯ ( R / J ( R ) ) . Let D = { x 1 , , x s } . To show that D is a total dominating set of G ¯ ( R ) , let y R . Then, there exists x i + J ( R ) D such that ( y + J ( R ) ) ( x i + J ( R ) ) in G ¯ ( R / J ( R ) ) , that is to say, y + x i + J ( R ) U ( R / J ( R ) ) . It follows from Lemma 3 that y + x i U ( R ) , and so y x i in G ¯ ( R ) . Thus, D is a total dominating set of G ¯ ( R ) , and hence γ t ( G ¯ ( R ) ) ) γ t ( G ¯ ( R / J ( R ) ) ) . □
Corollary 2. 
Let R be a ring. Then,
γ ( G ( R ) ) = γ ( G ¯ ( R ) ) γ t ( G ¯ ( R ) ) γ t ( G ¯ ( R / J ( R ) ) ) γ t ( G ( R / J ( R ) ) ) .
In particular, if γ ( G ( R ) ) = γ t ( G ( R / J ( R ) ) ) , then γ ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) .
Proof. 
This follows immediately from Lemma 14, Remark 1, Lemma 15, and Lemma 16. □
Lemma 17. 
Let R be a local ring which is not a field. Then, γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 2 .
Proof. 
Let R be a local ring which is not a field. Then, γ ( G ( R ) ) = 2 by Lemma 7, and so 2 = γ ( G ( R ) ) γ t ( G ( R ) ) by Remark 1. Since R is a local ring, for any x R , we have x U ( R ) or 1 + x U ( R ) by Lemma 1, and so { 0 , 1 } is a total dominating set of G ( R ) . Hence, γ t ( G ( R ) ) 2 , which together with 2 = γ ( G ( R ) ) γ t ( G ( R ) ) , implies that γ ( G ( R ) ) = γ t ( G ( R ) ) = 2 . Then, by Lemma 15, we obtain γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 2 . □
Lemma 18. 
Let R be a ring. Then, γ ( G ( Z 2 R ) ) 2 γ ( G ( R ) ) .
Proof. 
Assume that γ ( G ( R ) ) = k and D = { x 1 , x 2 , , x k } is a γ -set of G ( R ) . Let
Φ = Z 2 × D = { ( 0 , x 1 ) , ( 0 , x 2 ) , , ( 0 , x k ) , ( 1 , x 1 ) , ( 1 , x 2 ) , , ( 1 , x k ) } .
We claim that Φ is a dominating set of G ( Z 2 R ) . In fact, for any ( a , y ) ( Z 2 R ) Φ , we have y R D . Since D is a γ -set of G ( R ) , there exists d D such that d y in G ( R ) , i.e., d + y U ( R ) and d y .
If a = 0 , then ( 0 , y ) + ( 1 , d ) U ( Z 2 R ) and ( 1 , d ) ( 0 , y ) , i.e., ( 0 , y ) ( 1 , d ) in G ( Z 2 R ) .
If a = 1 , then ( 1 , y ) + ( 0 , d ) U ( Z 2 R ) and ( 0 , d ) ( 1 , y ) , i.e., ( 1 , y ) ( 0 , d ) in G ( Z 2 R ) .
Hence, Φ is a dominating set of G ( Z 2 R ) , and consequently, γ ( G ( Z 2 R ) ) 2 γ ( G ( R ) ) .
Remark 4. 
It is possibly that γ ( G ( Z 2 R ) ) < 2 γ ( G ( R ) ) . For example, we have by Lemma 11 and Lemma 10 that γ ( G ( Z 2 Z 3 Z 5 ) ) = 4 < 2 · 3 = 2 γ ( G ( Z 3 Z 5 ) ) .
Lemma 19. 
Let R be a ring. Then, 2 γ t ( G ¯ ( R ) ) γ t ( G ( Z 2 R ) ) 2 γ t ( G ( R ) ) .
Proof. 
Clearly, G ( Z 2 R ) is a bipartite graph with the bipartition V 1 = { 0 } R and V 2 = { 1 } R .
Suppose that γ t ( G ( R ) ) = k and D = { x 1 , , x k } is a γ t -set of G ( R ) . Let
D = Z 2 × D = { ( 0 , x 1 ) , , ( 0 , x k ) , ( 1 , x 1 ) , , ( 1 , x k ) } .
Then, D is a total dominating set of G ( Z 2 R ) . In fact, for any ( a , b ) Z 2 R , we have b R , and so there exists x b D such that b x b in G ( R ) . If a = 0 , then ( a , b ) ( 1 , x b ) in G ( Z 2 R ) . If a = 1 , then ( a , b ) ( 0 , x b ) in G ( Z 2 R ) . Hence, D is a total dominating set of G ( Z 2 R ) , and, consequently, γ t ( G ( Z 2 R ) ) 2 γ t ( G ( R ) ) .
To prove that 2 γ t ( G ¯ ( R ) ) γ t ( G ( Z 2 R ) ) , let D be a total dominating set of G ( Z 2 R ) . We claim that P R ( D V 1 ) is a total dominating set of G ¯ ( R ) , where
P R ( D V 1 ) = { r R | ( a Z 2 ) ( a , r ) D V 1 } = { r R | ( 0 , r ) D } .
In fact, for any s R , we have ( 1 , s ) Z 2 R , and so there exists ( 0 , x s ) D V 1 such that ( 1 , s ) ( 0 , x s ) in G ( Z 2 R ) . It follows that x s P R ( D V 1 ) and s + x s U ( R ) . Thus, P R ( D V 1 ) is a total dominating set of G ¯ ( R ) , and we conclude that γ t ( G ¯ ( R ) ) | P R ( D V 1 ) | | D V 1 | . Similarly, γ t ( G ¯ ( R ) ) | P R ( D V 2 ) | | D V 2 | . Thus, | D | = | D V 1 | + | D V 2 | 2 γ t ( G ¯ ( R ) ) .
Lemma 20. 
Let F be a field. Then, γ t ( G ( F ) ) = γ t ( G ¯ ( F ) ) = 2 and γ t ( G ( Z 2 F ) ) = 4 .
Proof. 
Let F be a field. It is clear that { 0 , 1 } is a total dominating set of G ( F ) and G ¯ ( F ) , so { 0 , 1 } is a γ t -set of G ( F ) and G ¯ ( F ) by Remark 2. Thus, γ t ( G ( F ) ) = γ t ( G ¯ ( F ) ) = 2 , and so γ t ( G ( Z 2 F ) ) = 4 by Lemma 19. □
Lemma 21. 
Let R be a ring, a R and D = { x 1 , x 2 , , x k } be a γ-set of G ( R ) . Let D / J ( R ) = { x i + J ( R ) | x i D } .
(i) 
If a + J ( R ) is not adjacent to any vertex of D / J ( R ) in G ¯ ( R / J ( R ) ) , then a is not adjacent to any vertex of D in G ( R ) .
(ii) 
If a D and a + J ( R ) is not adjacent to any vertex of D / J ( R ) in G ( R / J ( R ) ) , then a is not adjacent to any vertex of D in G ( R ) .
Proof. 
Let R , a , D and D / J ( R ) be as given in the lemma.
(i) If there exists x a D such that a x a in G ( R ) , then a + x a U ( R ) , which implies that ( a + J ( R ) ) + ( x a + J ( R ) ) = a + x a + J ( R ) U ( R / J ( R ) ) by Lemma 3. So, ( a + J ( R ) ) ( x a + J ( R ) ) in G ¯ ( R / J ( R ) ) . That is to say, a + J ( R ) is adjacent to a vertex of D / J ( R ) in G ¯ ( R / J ( R ) ) .
(ii) Suppose that a D and a + J ( R ) is not adjacent to any vertex of D / J ( R ) in G ( R / J ( R ) ) . If there exists x a D such that a x a in G ( R ) , then a + x a U ( R ) and a x a , which implies that ( a + J ( R ) ) + ( x a + J ( R ) ) = a + x a + J ( R ) U ( R / J ( R ) ) by Lemma 3. So ( a + J ( R ) ) ( x a + J ( R ) ) in G ¯ ( R / J ( R ) ) . Thus, a + J ( R ) = x a + J ( R ) , for otherwise, ( a + J ( R ) ) ( x a + J ( R ) ) in G ( R / J ( R ) ) , a contradiction.
Claim:  D { a } is a dominating set of G ( R ) .
In fact, let y R ( D { a } ) = ( R D ) { a } . If y R D , then y a and y x a , since a D and x a D . Since D is a γ -set of G ( R ) , there exists x y D such that y x y in G ( R ) .
Noticing that x a D { a } and
y a i n G ( R ) y + a U ( R ) y + a + J ( R ) U ( R / J ( R ) ) ( b y L e m m a 3 ) y + x a + J ( R ) U ( R / J ( R ) ) ( s i n c e a + J ( R ) = x a + J ( R ) ) y + x a U ( R ) ( b y L e m m a 3 ) y x a i n G ( R ) ,
we obtain that there exists v D { a } such that y v in G ( R ) . In addition, since a x a in G ( R ) , we have that D { a } is a dominating set of G ( R ) , which contradicts the fact that D is a γ -set of G ( R ) . □
Remark 5. 
In Lemma 21 (ii), the condition a D can not be deleted. For example, in the unit graph G ( Z 9 ) (see Figure 3), D = { 2 , 4 } is a γ-set of G ( Z 9 ) and 1 D . It is easy to see that 1 + J ( Z 9 ) is not adjacent to any vertex in D / J ( Z 9 ) = { 1 + J ( Z 9 ) , 2 + J ( Z 9 ) } in G ( Z 9 / J ( Z 9 ) ) G ( Z 3 ) , but 1 4 in G ( Z 9 ) .
Theorem 1. 
Let R be a ring with | J ( R ) | 2 . Then, γ ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) .
In particular, if 2 U ( R ) , then γ ( G ( R ) ) = γ t ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) = γ t ( G ( R / J ( R ) ) ) .
Proof. 
Assume that R is a ring with | J ( R ) | 2 . Using Corollary 2, we only need to verify the inequality
γ ( G ( R ) ) γ t ( G ¯ ( R / J ( R ) ) )
In fact, suppose that γ ( G ( R ) ) = k and let D = { a 1 , a 2 , , a k } be a γ -set of G ( R ) . Let
D / J ( R ) = { a 1 + J ( R ) , a 2 + J ( R ) , , a k + J ( R ) } .
Then | D / J ( R ) | | D | , and D / J ( R ) is a dominating set of G ( R / J ( R ) ) by the proof of [15] (Lemma 3.14). Hence, D / J ( R ) is a dominating set of G ¯ ( R / J ( R ) ) by the proof of Lemma 14.
If D / J ( R ) is a total dominating set of G ¯ ( R / J ( R ) ) , then the inequality (1) holds.
If D / J ( R ) is not a total dominating set of G ¯ ( R / J ( R ) ) , then there exists b + J ( R ) in D / J ( R ) such that b + J ( R ) a + J ( R ) for any a + J ( R ) D / J ( R ) in G ¯ ( R / J ( R ) ) . We claim that
b + J ( R ) D a n d | b + J ( R ) | 2 .
In fact, by Lemma 21 (i), we have v w in G ( R ) , for any v b + J ( R ) and any w D . So, b + J ( R ) D , since D is a γ -set of G ( R ) . Since | J ( R ) | 2 , we have | b + J ( R ) | = | J ( R ) | 2 using the well-known Lagrange Theorem. Thus, claim (2) holds.
Assume that b 1 + J ( R ) , b 2 + J ( R ) , , b s + J ( R ) are all mutually distinct vertexes in D / J ( R ) that are not adjacent to any vertex of D / J ( R ) . Noticing that for any
w + J ( R ) D / J ( R ) { b 1 + J ( R ) , b 2 + J ( R ) , , b s + J ( R ) } ,
there exists at least one element u w + J ( R ) such that u D by the definition of D / J ( R ) , we obtain through claim (2) that 2 s + ( | D / J ( R ) | s ) | D | ; i.e.,
| D / J ( R ) | + s | D | .
For each i { 1 , 2 , , s } , we have by Corollary 1 that d G ¯ ( R / J ( R ) ) ( b i + J ( R ) ) 1 , so there exists c i + J ( R ) ( R / J ( R ) ) ( D / J ( R ) ) such that c i + J ( R ) b i + J ( R ) in the graph G ¯ ( R / J ( R ) ) . Let
D t = ( D / J ( R ) ) { c 1 + J ( R ) , c 2 + J ( R ) , , c s + J ( R ) } .
It is easy to verify that D t is a total dominating set of G ¯ ( R / J ( R ) ) , and | D t | | D / J ( R ) | + s | D | by (3). Consequently, the inequality (1) holds. Thus, γ ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) .
Finally, if 2 U ( R ) , then 2 + J ( R ) U ( R / J ( R ) ) by Lemma 3. It follows by Definition 1 that G ¯ ( R ) = G ( R ) and G ¯ ( R / J ( R ) ) = G ( R / J ( R ) ) . Thus, γ ( G ( R ) ) = γ t ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) = γ t ( G ( R / J ( R ) ) ) by Lemma 6. □
Remark 6. 
In Theorem 1, the condition | J ( R ) | 2 cannot be deleted. For example, let F be a field. Then, γ ( G ( F ) ) = 1 by Lemma 7, but γ t ( G ¯ ( F ) ) = 2 by Lemma 20.
Corollary 3. 
Let m , n be positive integers, and n = p 1 α 1 p 2 α 2 p m α m , where p 1 < p 2 < < p m are primes and α i ’s are positive integers. Then, the following statements hold:
(i) 
If α 1 α 2 α m > 1 , then γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) ) .
(ii) 
If m = 1 and α 1 = 1 , then γ ( G ( Z p 1 ) ) = 1 , γ t ( G ¯ ( Z p 1 ) ) = γ t ( G ( Z p 1 ) ) = 2 .
(iii) 
If m = 1 and α 1 > 1 , then γ ( G ( Z p 1 α 1 ) ) = γ t ( G ¯ ( Z p 1 α 1 ) ) = γ t ( G ( Z p 1 α 1 ) ) = 2 .
(iv) 
If m = 2 , α 1 α 2 = 1 and p 1 3 , then γ ( G ( Z p 1 Z p 2 ) ) = γ t ( G ¯ ( Z p 1 Z p 2 ) ) = γ t ( G ( Z p 1 Z p 2 ) ) = 3 .
(v) 
If m = 2 , α 1 α 2 > 1 and p 1 3 , then γ ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = γ t ( G ¯ ( Z p 1 α 1 Z p 2 α 2 ) ) = γ t ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = 3 .
(vi) 
If m = 2 , α 1 α 2 = 1 and p 1 = 2 , then γ ( G ( Z 2 Z p 2 ) ) = 2 , γ t ( G ( Z 2 Z p 2 ) ) = 4 .
(vii) 
If α 1 α 2 α m > 1 and p 1 = 2 , then γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) ) , and in particular, γ ( G ( Z 2 α 1 Z p 2 α 2 ) ) = γ t ( G ( Z 2 α 1 Z p 2 α 2 ) ) = 4 .
(viii) 
If m = 3 and α 1 α 2 α 3 > 1 , then
γ ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = γ t ( G ¯ ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) )
= γ t ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
(ix) 
If m = 3 and α 1 α 2 α 3 = 1 , then γ ( G ( Z p 1 Z p 2 Z p 3 ) ) = 4 , and
γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 ) ) = γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
Proof. 
Let m and n be as given in the Corollary. Then, Z n Z p 1 α 1 Z p 2 α 2 Z p m α m .
(i) If α 1 α 2 α m > 1 , then | J ( Z n ) | 2 . By Lemma 3, we have
Z n / J ( Z n ) Z p 1 α 1 / p 1 Z p 2 α 2 / p 2 Z p m α m / p m Z p 1 Z p 2 Z p m .
Thus, γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) ) by Theorem 1.
(ii) If m = 1 and α 1 = 1 , then γ ( G ( Z p 1 ) ) = 1 by Lemma 7, γ t ( G ¯ ( Z p 1 ) ) = γ t ( G ( Z p 1 ) ) = 2 by Lemma 20.
(iii) If m = 1 and α 1 > 1 , then Z p 1 α 1 is a local ring which is not a field, so γ ( G ( Z p 1 α 1 ) ) = γ t ( G ¯ ( Z p 1 α 1 ) ) = γ t ( G ( Z p 1 α 1 ) ) = 2 by Lemma 17.
(iv) If m = 2 , α 1 α 2 = 1 and p 1 3 , then γ ( G ( Z p 1 Z p 2 ) ) = γ t ( G ( Z p 1 Z p 2 ) ) = 3 by Lemma 10, and so γ ( G ( Z p 1 Z p 2 ) ) = γ t ( G ¯ ( Z p 1 Z p 2 ) ) = γ t ( G ( Z p 1 Z p 2 ) ) = 3 by Lemma 15.
(v) If m = 2 , α 1 α 2 > 1 and p 1 3 , then γ ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = 3 by Lemma 7 (iii). It follows by item (iii) that γ t ( G ( Z p 1 Z p 2 ) ) = 3 = γ ( G ( Z p 1 α 1 Z p 2 α 2 ) ) , and so γ t ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = 3 by Lemma 6. Therefore, by Lemma 15 we have γ ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = γ t ( G ¯ ( Z p 1 α 1 Z p 2 α 2 ) ) = γ t ( G ( Z p 1 α 1 Z p 2 α 2 ) ) = 3 .
(vi) If m = 2 , α 1 α 2 = 1 and p 1 = 2 , then γ ( G ( Z 2 Z p 2 ) ) = 2 by Lemma 7 (ii), and γ t ( G ( Z 2 Z p 2 ) ) = 4 by Lemma 20.
(vii) If α 1 α 2 α m > 1 and p 1 = 2 , then | J ( Z n ) | 2 and 2 U ( Z n ) , and so γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) ) by Theorem 1. In particular, γ ( G ( Z 2 α 1 Z p 2 α 2 ) ) = γ t ( G ( Z 2 α 1 Z p 2 α 2 ) ) = γ t ( G ( Z 2 Z p 2 ) ) = 4 by item (iii).
(viii) If m = 3 and α 1 α 2 α 3 > 1 , then by [16] (Theorem 2.5 and Remark 2.6) we have
γ ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = γ t ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
Thus, by Lemma 15, we obtain
γ ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = γ t ( G ¯ ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) )
= γ t ( G ( Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
(ix) If m = 3 and α 1 α 2 α 3 = 1 , then γ ( G ( Z p 1 Z p 2 Z p 3 ) ) = 4 by Lemma 11.
By Theorem 1 and Corollary 3 item (viii), we obtain
γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
When p 1 = 2 , we have γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 ) ) = 6 , since 2 U ( R ) . By Appendix A, we have γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) 5 when p 1 = 3 , and γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) 4 when p 1 > 3 . In addition, γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 ) ) γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) by Lemma 15. Hence,
γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 ) ) = γ t ( G ( Z p 1 Z p 2 Z p 3 ) ) = 6 , i f p 1 = 2 ; 5 , i f p 1 = 3 ; 4 , i f p 1 > 3 .
Remark 7. 
In Theorem 1, for a γ-set D of G ( R ) , D / J ( R ) may not be a total dominating set of ( G ¯ ( R / J ( R ) ) ) .
For example, consider the unit graph G ( Z 4 Z 3 ) of the ring Z 4 Z 3 (see Figure 4), let D = { ( 0 , 1 ) , ( 2 , 1 ) , ( 1 , 2 ) , ( 3 , 2 ) } . Then, D is a dominating set of G ( Z 4 Z 3 ) , and so D is a γ-set of G ( Z 4 Z 3 ) , since γ ( G ( Z 4 Z 3 ) ) = 4 by Corollary 3. But
D / J ( Z 4 Z 3 ) = { ( 0 , 1 ) , ( 1 , 2 ) }
is not a total dominating set of G ¯ ( ( Z 4 Z 3 ) / J ( Z 4 Z 3 ) ) = G ¯ ( Z 2 Z 3 ) , since ( 0 , 1 ) ( 1 , 2 ) and ( 0 , 1 ) ( 0 , 1 ) in G ¯ ( Z 2 Z 3 ) . According to the proof of Theorem 1, if we add ( 1 , 0 ) and ( 0 , 0 ) to D / J ( Z 4 Z 3 ) and obtain D t = { ( 0 , 1 ) , ( 1 , 2 ) , ( 1 , 0 ) , ( 0 , 0 ) } , then D t is a total dominating set of G ¯ ( Z 2 Z 3 ) and | D t | = 4 = γ ( G ( Z 4 Z 3 ) ) .
Remark 8. 
In Theorem 1, the proof is not appropriate when γ t ( G ¯ ( R / J ( R ) ) ) is replaced by γ t ( G ( R / J ( R ) ) ) . For example, consider the unit graph G ( Z 9 Z 5 ) . Let D = { ( 0 , 1 ) , ( 1 , 4 ) , ( 2 , 2 ) } . Then, D is a dominating set of G ( Z 9 Z 5 ) , since
N G ( Z 9 Z 5 ) ( ( 0 , 1 ) ) = { ( a , b ) Z 9 Z 5 | a { 0 , 3 , 6 } a n d b 4 } N G ( Z 9 Z 5 ) ( ( 1 , 4 ) ) = { ( a , b ) Z 9 Z 5 | a { 2 , 5 , 8 } a n d b 1 } { ( 1 , 4 ) } N G ( Z 9 Z 5 ) ( ( 2 , 2 ) ) = { ( a , b ) Z 9 Z 5 | a { 1 , 4 , 7 } ; b 3 } { ( 2 , 2 ) }
It follows that D is a γ-set of G ( Z 9 Z 5 ) , since γ ( G ( Z 9 Z 5 ) ) = 3 by Corollary 3. Observe that
D / J ( Z 9 Z 5 ) = { ( 0 , 1 ) , ( 1 , 4 ) , ( 2 , 2 ) }
is a total dominating set of G ¯ ( ( Z 9 Z 5 ) / J ( Z 9 Z 5 ) ) = G ¯ ( Z 3 Z 5 ) (see Figure 5), but D / J ( Z 9 Z 5 ) is not a total dominating set of G ( Z 3 Z 5 ) , since ( 1 , 4 ) ( 0 , 1 ) and ( 1 , 4 ) ( 2 , 2 ) . Adding ( 1 , 0 ) to D / J ( Z 9 Z 5 ) , we obtain that D t = { ( 0 , 1 ) , ( 1 , 4 ) , ( 2 , 2 ) , ( 1 , 0 ) } is a total dominating set of G ( Z 3 Z 5 ) , but from which we cannot deduce that γ t ( G ( Z 3 Z 5 ) ) γ ( G ( Z 9 Z 5 ) ) , since | D t | = 4 > 3 = γ ( G ( Z 9 Z 5 ) ) . In fact, we can also obtain that D t = { ( 0 , 1 ) , ( 1 , 3 ) , ( 2 , 2 ) } is a total dominating set of G ( Z 3 Z 5 ) , and so γ t ( G ( Z 9 Z 5 ) ) 3 = γ ( G ( Z 9 Z 5 ) ) .

4. The Unit Graph of the Ring Z n

For a ring R, according to Theorem 1, to study the domination number of the unit graph G ( R ) , it suffices to study the total dominating number of the unit graph associated with the semisimple ring R / J ( R ) . That is to say, it suffices to consider the cases when R is a direct product of some fields by Lemma 5. In particular, to study the domination number of the unit graph G ( Z n ) , it suffices to consider the case when Z n is directly decomposed into certain fields. By Corollary 3, the domination number and the total dominating number of G ( Z n ) , when n has less than three prime divisors, can be investigated.
In this section, we focus on studying the domination number and the total dominating number of G ( Z n ) when n has at least four prime divisors. Without loss of generality, we assume that T = Z p 1 Z p 2 Z p m , where p 1 < p 2 < < p m are primes and m 4 is an integer.

4.1. Case  p 1 m + 1

Proposition 1. 
Let p 1 m + 1 . Then, γ ( G ( T ) = γ t ( G ¯ ( T ) = γ t ( G ( T ) ) = m + 1 .
Proof. 
Let m , p i ( 1 i m ) be as given in the proposition, and let
D = { ( 0 , 0 , , 0 ) m t i m e s , ( 1 , 1 , , 1 ) m t i m e s , , ( m , m , , m ) m t i m e s } .
Then, D is a total dominating set of G ( T ) . In fact, since p 1 m + 1 , we have D T . Suppose, on the contrary, that there exists ( a 1 , a 2 , , a m ) T such that ( a 1 , a 2 , , a m ) ( i , i , , i ) (in G ( T ) ) for any ( i , i , , i ) D . Then, there exists i j { 1 , 2 , , m } ( j = 0 , 1 , , m ) such that
a i 0 + 0 = 0 , a i 1 + 1 = 0 , , a i m + m = 0 .
By the well-known pigeonhole principle [20] (Theorem 3.1.1), there exist s , t { 0 , 1 , , m } with s t such that a i s = a i t , but this implies that a i s + s = 0 = a i t + t = a i s + t in the field Z p i s , and so s = t , a contradiction. Thus, D is a total dominating set of G ( T ) , and hence γ t ( G ( T ) ) m + 1 . It follows from Remark 1, Lemma 15, and Lemma 12 that
m + 1 γ ( G ( T ) ) γ t ( G ¯ ( T ) ) γ t ( G ( T ) ) m + 1 ,
and consequently, γ ( G ( T ) ) = γ t ( G ¯ ( T ) ) = γ t ( G ( T ) ) = m + 1 . □
Remark 9. 
Proposition 1 also holds true when m = 3 in its proof.
If p 1 m + 1 , in the proof of Proposition 1, let
D = { ( b 1 , b 1 , , b 1 ) m t i m e s , ( b 2 , b 2 , , b 2 ) m t i m e s , , ( b k , b k , , b k ) m t i m e s } ,
where k is a positive integer with k m + 1 , and b 1 , , b k { 0 , 1 , , p 1 1 } are mutually different. One can similarly prove that D is also a total dominating set of G ( T ) .

4.2. Case  3 p 1 m p 2

Let A 1 and A 2 be nonempty sets. For a subset B of A 1 × A 2 (the Cartesian product of A 1 and A 2 ), let P A 1 ( B ) = { a 1 A 1 | ( a 2 A 2 ) ( a 1 , a 2 ) B } and
P A 2 ( B ) = { a 2 A 2 | ( a 1 A 1 ) ( a 1 , a 2 ) B } .
P A 1 ( B ) and P A 2 ( B ) are called, respectively, the projection of B on A 1 and the projection of B on A 2 .
Lemma 22. 
Let 3 p 1 m p 2 and let D be a dominating set of G ( T ) such that the projection of D on Z p 1 is P Z p 1 ( D ) = { a 1 , a 2 , , a t } , where t is a positive integer. For each a i , let the cardinality of the projection of ( { a i } Z p 2 Z p m ) D on Z p 2 Z p m be k i , i.e,
| P Z p 2 Z p m ( ( { a i } Z p 2 Z p m ) D ) | = k i , i = 1 , 2 , , t
Let z i = ( j = 1 t k j ) k i , i = 1 , 2 , , t .
If t = 1 or z j < m for some j { 1 , 2 , , t } , then | D | 2 m 1 .
Proof. 
Let D, t, z i , k i , i = 1 , 2 , , t be as given in the lemma. Then, 1 t p 1 , since P Z p 1 ( D ) = { a 1 , a 2 , , a t } Z p 1 .
If t = 1 , i.e., P Z p 1 ( D ) = { a 1 } , then for any x { ( a 1 , x 2 , , x m ) | x i Z p i , i = 2 , , m } and any y D , we have x y in G ( T ) . It follows that
{ ( a 1 , x 2 , , x m ) | x i Z p i , i = 2 , , m } D ,
since D is a dominating set of G ( T ) . Hence, | D | p 2 p m p 2 p 3 4 m > 2 m 1 , since 4 m p 2 < p 3 .
Assume that t 2 and z j < m for some j { 1 , 2 , , t } . Without loss of generality, we assume that z 1 < m . Since
| P Z p 2 Z p m ( ( { a 2 , a 3 , , a t } Z p 2 Z p m ) D ) | = | i = 2 t ( P Z p 2 Z p m ( ( { a i } Z p 2 Z p m ) D ) ) | i = 2 t ( | P Z p 2 Z p m ( ( { a i } Z p 2 Z p m ) D ) ) | ) = k 2 + k 3 + + k t = z 1 ,
we may assume that
P Z p 2 Z p m ( ( { a 2 , a 3 , , a t } Z p 2 Z p m ) D ) = { ( b j 2 , b j 3 , , b j m ) | j = 1 , , } ,
where is a positive integer and 1 z 1 . Let A be a subset of T such that
( x 1 , x 2 , x m ) A x 1 = a 1 , x q = b q 1 , q , q { 2 , 3 , , + 1 } ; a n d x s Z p s , s { + 2 , , m } ,
that is to say,
A = { ( a 1 , b 12 , b 23 , , b , + 1 , x + 2 , , x m ) | x s Z p s , s = + 2 , , m }
Then, for any x A and any y D , we have x y in G ( T ) , and so A D , since D is a dominating set of G ( T ) . Noticing that 1 z 1 < m , we have 1 z 1 m 1 .
If 1 m 3 , then | D | | A | = p m p m 1 p 2 p 3 4 m > 2 m 1 , since 4 m p 2 < p 3 .
Assume m 2 m 1 . Consider the following cases.
Case(i): There exists i { 2 , 3 , , m } such that there are at least two elements among b 1 i , b 2 i , , b i that are equal. Without loss of generality, assume that b 1 i = b 2 i .
Let Ω be a subset of T such that
( x 1 , x 2 , x i , , x m ) Ω x 1 = a 1 , x i = b 1 i , a n d t h e r e e x i s t s { j 3 , j 4 , , j } { 2 , , m } { i } s u c h t h a t x j q = b q j q , q = 3 , ,
(Note: For example, if i = 3 , we may let j q = q , i f q = 4 , , ; q 1 , i f q = 3 , and then
{ ( a 1 , b 32 , b 13 , b 44 , , b , x + 1 , , x m ) | x s Z p s , s = + 1 , , m } Ω .
If i = + 1 , we may let j q = q 1 for any q { 3 , , } , and then
{ ( a 1 , b 32 , b 43 , , b , 1 , x , b 1 i , x l + 2 , , x m ) | x s Z p s , s = l , l + 2 , , m } Ω . )
For any x Ω and any y D , we have x y in G ( T ) , and so Ω D , since D is a dominating set of G ( T ) . It follows that a 1 P Z p 1 ( D ) = { a 1 , a 2 , , a t } , and | D | | Ω | p 2 (since m 1 ).
When l = m 2 , we obtain | D | | Ω | p 2 p 3 4 m > 2 m 1 , since 4 m p 2 < p 3 .
When l = m 1 , we claim that a 1 = a 1 . In fact, if a 1 a 1 , then a 1 { a 2 , , a t } , since a 1 P Z p 1 ( D ) = { a 1 , a 2 , , a t } . So, Ω { a 2 , a 3 , , a t } Z p 2 Z p m ) D , and thus
P Z p 2 Z p m ( Ω ) P Z p 2 Z p m ( ( { a 2 , a 3 , , a t } Z p 2 Z p m ) D ) ,
which implies that p 2 | Ω | = | P Z p 2 Z p m ( Ω ) | = = m 1 < m , but p 2 m , a contradiction. Thus, a 1 = a 1 in Z p 1 , and so a 1 = 0 , since p 1 3 . Therefore, we have
| D | | Ω | + | ( ( { a 1 , a 2 , , a t } { a 1 } ) Z p 2 Z p m ) D | = | Ω | + | ( { a 2 , , a t } Z p 2 Z p m ) D | p 2 + m + ( m 1 ) = 2 m 1
since m p 2 and = m 1 .
Case(ii): b 1 i , , b i are mutually different, for any i { 2 , , m } .
Let S denote the symmetric group on the set { 1 , 2 , , } , and let Ψ be a subset of T such that
( x 1 , x 2 , x m ) Ψ x 1 = a 1 , a n d t h e r e e x i s t s a p e r m u t a t i o n j 1 j 2 j S s u c h t h a t x j q = b j q ( q + 1 ) , q = 1 , 2 , ,
that is to say,
Ψ = { ( a 1 , b j 1 2 , b j 2 3 , , b j , + 1 , x + 2 , , x m ) | x i Z p i , i = + 2 , , m , j 1 j S } .
Then, for any x Ψ and any y D , we have x y in G ( T ) , and so Ψ D , since D is a dominating set of G ( T ) . Thus, a 1 P Z p 1 ( D ) = { a 1 , a 2 , , a t } and | D | | Ψ | .
In addition, since ( ( { a 1 , a 2 , , a t } { a 1 } ) Z p 2 Z p m ) D D , we have
| D | | Ψ | + | ( ( { a 1 , a 2 , , a t } { a 1 } ) Z p 2 Z p m ) D | ! p 2 + 1 , i f = m 2 ; ! + 1 , i f = m 1 .
If = m 1 , then ! + 1 2 ( m 1 ) + 1 = 2 m 1 , since m 1 3 . If = m 2 , then ! p 2 + 1 2 m + 1 > 2 m 1 , since m 2 2 and p 2 m . Hence, | D | 2 m 1 . □
Proposition 2. 
Let 3 p 1 m p 2 . Then, γ ( G ( T ) ) p 1 p 1 1 m . In particular, if m = ( p 1 1 ) q + r , where q and r are non-negative integers with r < p 1 1 , then
γ ( G ( T ) p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .
Proof. 
Let 3 p 1 m p 2 and D be a dominating set of G ( T ) . Assume that
P Z p 1 ( D ) = { a 1 , a 2 , , a t }
and
| P Z p 2 Z p m ( ( { a i } Z p 2 Z p m ) D ) | = k i , i = 1 , 2 , , t
Then, 1 t p 1 and | D | = k 1 + k 2 + + k t . Let z i = ( j = 1 t k j ) k i , i = 1 , 2 , , t .
If t = 1 or z j < m for some j { 1 , 2 , , t } , then | D | 2 m 1 by Lemma 22. Since 3 p 1 m , we have ( 2 p 1 p 1 1 ) m = p 1 2 p 1 1 m = m p 1 1 ( p 1 2 ) p 1 2 1 , and so | D | 2 m 1 p 1 p 1 1 m .
If t > 1 and z i m for any i { 1 , 2 , , t } , then we have
k 2 + k 3 + + k t = ( j = 1 t k j ) k 1 = z 1 m k 1 + k 3 + + k t = ( j = 1 t k j ) k 2 = z 2 m k 1 + k 2 + k 4 + k t = ( j = 1 t k j ) k 3 = z 3 m k 1 + k 2 + + k t 1 = ( j = 1 t k j ) k t = z t m
and so ( t 1 ) | D | = ( t 1 ) ( j = 1 t k j ) t m . Thus, | D | t t 1 m p 1 p 1 1 m , since t p 1 .
In particular, let m = ( p 1 1 ) q + r , where q and r are non-negative integers and r < p 1 1 .
If r = 0 , then p 1 p 1 1 m = p 1 q , so γ ( G ( T ) ) p 1 q .
If r 0 , then p 1 p 1 1 m is not an integer but | D | is an integer and | D | p 1 p 1 1 m , so
| D | [ p 1 p 1 1 m ] + 1 = [ m + m p 1 1 ] + 1 = m + [ m p 1 1 ] + 1 = m + q + 1 = p 1 q + r + 1 ,
where [ x ] is the bracket function. □
Lemma 23. 
Let 3 p 1 , D T and P Z p 1 ( D ) = Z p 1 . If for any x Z p 1 ,
P Z p 2 Z p m ( ( ( Z p 1 { x } ) Z p 2 Z p m ) D )
is a total dominating set of G ( Z p 2 Z p m ) , then D is a total dominating set of G ( T ) .
Proof. 
Let D be as given in the lemma. For any ( x 1 , x 2 , , x m ) T , let
Λ = P Z p 2 Z p m ( ( ( Z p 1 { x 1 } ) Z p 2 Z p m ) D ) .
Then, Λ is total a dominating set of G ( Z p 2 Z p m ) by assumption, and so there exists ( b 2 , b 3 , , b m ) Λ such that ( x 2 , x 3 , , x m ) ( b 2 , b 3 , , b m ) in G ( Z p 2 Z p m ) , i.e.,
( x 2 , x 3 , x m ) + ( b 2 , b 3 , , b m ) U ( Z p 2 Z p m )   and ( x 2 , , x m ) ( b 2 , b 3 , , b m )
Since ( b 2 , b 3 , , b m ) Λ , there exists y Z p 1 { x 1 } such that ( y , b 2 , b 3 , , b m ) D . It follows that y x 1 , and thus
( x 1 , x 2 , , x m ) + ( y , b 2 , b 3 , , b m ) U ( Z p 1 Z p 2 Z p m )
In addition, since ( x 2 , , x m ) ( b 2 , b 3 , , b m ) , we have ( x 1 , x 2 , , x m ) ( y , b 2 , b 3 , , b m ) . Hence, ( x 1 , x 2 , , x m ) ( y , b 2 , b 3 , , b m ) in G ( T ) , and consequently, D is a total dominating set of G ( T ) . □
Proposition 3. 
Let 3 p 1 m and p 2 p 1 p 1 1 m . If m = ( p 1 1 ) q + r , where q and r are non-negative integers with r < p 1 1 , then,
γ ( G ( T ) = γ t ( G ¯ ( T ) ) = γ t ( G ( T ) = p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .
Proof. 
Let 3 p 1 m and p 2 p 1 p 1 1 m . Using the division algorithm, there is a unique pair of non-negative integers q and r such that m = ( p 1 1 ) q + r , where r < p 1 1 . Consider the following cases:
Case(i):  r = 0 . In this case, we have m = ( p 1 1 ) q , and so p 2 p 1 p 1 1 m = p 1 q . In addition, we have q 2 , for otherwise, q = 1 implies that m = p 1 1 < p 1 , which contradicts the fact that 3 p 1 m . Let D = A 0 A 1 A 2 A p 1 1 , where
A 0 = { ( 0 , 0 , , 0 ) m t i m e s } { ( 0 , j , , j ) m t i m e s | ( p 1 1 ) q + 1 j p 1 q 1 } ,
A i = { ( i , j , , j ) m t i m e s | ( i 1 ) q + 1 j i q } , i { 1 , 2 , , p 1 1 } .
Then, D T , since p 1 q 1 < p 1 q p 2 < p 3 < < p m .
Noticing that | A u | = q and A u A v = for any u , v { 0 , 1 , , p 1 1 } and u v , we have | D | = i = 0 p 1 1 | A i | = p 1 q . In addition, we have P Z p 1 ( D ) = Z p 1 , and for any x Z p 1 ,
P Z p 2 Z p m ( ( ( Z p 1 { x } ) Z p 2 Z p m ) D )
is a total dominating set of G ( Z p 2 Z p m ) by Remark 9.
(Note: For example, we have
P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D ) = { ( j , , j ) m 1 t i m e s | 1 j ( p 1 1 ) q } ,
and | P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D ) | = ( p 1 1 ) q = m . Since p 2 p 1 p 1 1 m > m = ( m 1 ) + 1 , we immediately find by Remark 9 that P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D ) is a total dominating set of G ( Z p 2 Z p m ) .)
It follows from Lemma 23 that D is a total dominating set of G ( T ) , hence
p 1 q γ ( G ( T ) ) γ t ( G ( T ) ) | D | = p 1 q
by Proposition 2 and Remark 1. Consequently, we obtain that γ ( G ( T ) ) = γ t ( G ( T ) ) = p 1 q .
Case(ii):  r 0 . Since p 2 p 1 p 1 1 m , we have
p 2 [ p 1 p 1 1 m ] + 1 = [ m + m p 1 1 ] + 1 = m + [ m p 1 1 ] + 1 = m + q + 1 = p 1 q + r + 1 .
Let B = B 1 B 2 B p 1 1 B 0 , where
B i = { ( i , j , , j ) m t i m e s | ( i 1 ) q + i j i q + i } , i { 1 , , r } , B = { ( , j , , j ) m t i m e s | ( 1 ) q + r + 1 j q + r } , { r + 1 , , p 1 1 } , B 0 = { ( 0 , 0 , , 0 ) m t i m e s } { ( 0 , j , , j ) m t i m e s | ( p 1 1 ) q + r + 1 j p 1 q + r } .
Then B T ( p 1 q + r < p 2 ). Noticing that | B i | = q + 1 for any i { 0 , 1 , 2 , , r } , | B | = q for any { r + 1 , r + 2 , , p 1 1 } and B u B v = for any u , v { 0 , 1 , , p 1 1 } with u v , we have | B | = i = 0 r | B i | + = r + 1 p 1 1 | B | = ( r + 1 ) ( q + 1 ) + ( p 1 1 r ) q = p 1 q + r + 1 since | B 0 | = p 1 q + r ( ( p 1 1 ) q + r + 1 ) + 1 + 1 = q + 1 , | B i | = i q + i ( ( i 1 ) q + i ) + 1 = q + 1 for any i { 1 , , r } and | B | = q for any { r + 1 , r + 2 , , p 1 1 } similarly.
In addition, we have P Z p 1 ( B ) = Z p 1 , and for any x Z p 1 ,
P Z p 2 Z p m ( ( ( Z p 1 { x } ) Z p 2 Z p m ) B )
is a total dominating set of G ( Z p 2 Z p m ) by Remark 9.
(Note: For example, we have
P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D ) = { ( j , , j ) m 1 t i m e s | 1 j ( p 1 1 ) q + r } ,
and | P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D ) | = ( p 1 1 ) q + r = m . In addition,
P Z p 2 Z p m ( ( ( Z p 1 { p 1 1 } ) Z p 2 Z p m ) D ) = { ( j , , j ) m 1 t i m e s | j { 0 , 1 , , ( p 1 2 ) q + r } { ( p 1 1 ) q + r + 1 , , p 1 q + r } } ,
and | P Z p 2 Z p m ( ( ( Z p 1 { p 1 1 } ) Z p 2 Z p m ) D ) | = ( p 1 1 ) q + r + 1 = m + 1 .
Since p 2 p 1 p 1 1 m > m = ( m 1 ) + 1 , we immediately find through Remark 9 that both
P Z p 2 Z p m ( ( ( Z p 1 { 0 } ) Z p 2 Z p m ) D )   and P Z p 2 Z p m ( ( ( Z p 1 { p 1 1 } ) Z p 2 Z p m ) D )
are total dominating sets of G ( Z p 2 Z p m ) .)
It follows immediately from Lemma 23 that B is a total dominating set of G ( T ) , and so
p 1 q + r + 1 γ ( G ( T ) ) γ t ( G ( T ) ) | B | = p 1 q + r + 1
by Proposition 2 and Lemma 1. Hence, γ ( G ( T ) ) = γ t ( G ( T ) ) = p 1 q + r + 1 .
Summarizing the above arguments, we obtain by Lemma 15 that
γ ( G ( T ) = γ t ( G ¯ ( T ) ) = γ t ( G ( T ) ) = p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .

4.3. Case  p 1 = 2

Lemma 24. 
If 4 is an integer, and q 1 < q 2 < < q are primes, then < q 1 < q .
Proof. 
Assume that 4 is an integer, and q 1 < q 2 < < q are primes. Then, q 3 5 and q 4 7 . If = 4 , then = 4 < 5 q 3 < q 4 .
If > 4 , then q > q 1 q 4 + 5 7 + 5 = + 2 > , since 7 q 4 . □
Lemma 25. 
Let p 1 = 2 . Then, γ ( G ( T ) ) 2 m .
Proof. 
By Lemma 24, we have m < p m 1 < p m . Let p 1 = 2 . Suppose, on the contrary, that D is a dominating set of G ( T ) with | D | = 2 m 1 .
Let V 1 = { 0 } Z p 2 Z p 3 Z p m , and V 2 = { 1 } Z p 2 Z p 3 Z p m . Then, T = V 1 V 2 and V 1 V 2 = , which implies that D = ( D V 1 ) ( D V 2 ) and ( D V 1 ) ( D V 2 ) = . Since | D | = 2 m 1 , we have | D V 1 | < m or | D V 2 | < m . Without loss of generality, we assume that | D V 1 | < m and let
D V 1 = { ( 0 , a i 2 , a i 3 , , a i m ) | i = 1 , 2 , , k } ,
where k = | D V 1 | < m . Consider the following cases:
Case(1):  k < m 2 .
Let C be a subset of T such that
( x 1 , x 2 , x m ) C x 1 = 1 , x q = a q 1 , q , q { 2 , 3 , , k + 1 } ; a n d x s Z p s , s { k + 2 , , m }
That is to say,
C = { ( 1 , a 12 , a 23 , , a k , k + 1 , x k + 2 , , x m ) | x s Z p s , s = k + 2 , , m } .
Then, x y for any x C and any y D in G ( T ) , which implies that C D , since D is a dominating set of G ( T ) . Thus, | D | | C | p m 1 p m > 2 m , since k < m 2 , 2 < p m 1 and p m > m . But | D | = 2 m 1 , a contradiction.
Case(2):  k = m 2 .
If a 12 = a 22 = = a k 2 , then for any x { ( 1 , a 12 , x 3 , , x m ) | x i Z p i , i = 3 , , m } , we have x y for any y D . So,
{ ( 1 , a 12 , x 3 , , x m ) | x i Z p i , i = 3 , , m } D
Hence, | D | | { ( 1 , a 12 , x 3 , , x m ) | x i Z p i , i = 3 , , m } | p m 1 p m > 2 m , since m 4 , 2 < p m 1 and p m > m , which is a contradiction with | D | = 2 m 1 .
If there exist i , j { 2 , , k } such that a i 2 a j 2 , without loss of generality, say a 12 a 22 . Let Y 1 and Y 2 be, respectively, subsets of T such that
( x 1 , x 2 , x m ) Y 1 x 1 = 1 , x q = a q 1 , q , q { 2 , 3 , , k + 1 } a n d x m Z p m
(i.e., Y 1 = { ( 1 , a 12 , a 23 , , a k , k + 1 , x m ) | x m Z p m } ) and
( x 1 , x 2 , , x m ) Y 2 x 1 = 1 , x 2 = a 22 , x 3 = a 13 , x q = a q 1 , q , q { 4 , , k + 1 } a n d x m Z p m
(i.e., Y 2 = { ( 1 , a 22 , a 13 , a 34 , , a k , k + 1 , x m ) | x m Z p m } .) Then, Y 1 Y 2 = , since a 12 a 22 . Let Y = Y 1 Y 2 . Then, x y for any x Y and any y D , which implies that Y D in G ( T ) , since D is a dominating set of G ( T ) . Thus, | D | | Y | = | Y 1 | + | Y 2 | = 2 p m > 2 m , since p m > m , which is a contradiction with | D | = 2 m 1 .
Case(3):  k = m 1 .
In this case, we have | D V 1 | = k = m 1 , and so | D V 2 | = m , since | D | = 2 m 1 , D = ( D V 1 ) ( D V 2 ) and ( D V 1 ) ( D V 2 ) = .
Subcase(3.1): There exists i { 2 , 3 , , m } such that there are at least two elements among a 1 i , a 2 i , , a k i that are equal, and without loss of generality, assume that a 1 i = a 2 i .
Let C 1 be a subset of T such that
( x 1 , x 2 , x i , , x m ) C 1 x 1 = 1 , x i = a 1 i , a n d t h e r e e x i s t s { j 3 , j 4 , , j k } { 2 , , m } { i } s u c h t h a t x j q = a q j q , q = 3 , , k
(For example, if i = 3 and a 13 = a 23 , we may let j q = q , i f q = 4 , , k ; q 1 , i f q = 3 , , then
{ ( 1 , a 32 , a 13 , a 44 , , a k k , x m ) | x m Z p m } C 1 .
If i = m and a 1 m = a 2 m , we may let j q = q 1 for any q { 3 , , k } , then
{ ( 1 , a 32 , a 43 , , a k , k 1 , x k , a 1 m ) | x k Z p m 1 } C 1 ) .
For any x C 1 and any y D , we have x y in G ( T ) , and so C 1 D V 2 , since D is a dominating set of G ( T ) and C 1 V 2 . Hence, | D V 2 | | C 1 | p m 1 > m , which is a contradiction with | D V 2 | = m .
Subcase(3.2):  a 1 i , a 2 i , , a k i are mutually different, for any i { 2 , 3 , , m } .
Let S k denote the symmetric group on the set { 1 , 2 , , k } , and let C 2 be a subset of T such that
( x 1 , x 2 , x m ) C 2 x 1 = 1 , a n d t h e r e e x i s t s a p e r m u t a t i o n j 1 j 2 j k S k s u c h t h a t x j q = a j q ( q + 1 ) , q = 1 , 2 , , k
that is to say, C 2 = { ( 1 , a j 1 2 , a j 2 3 , , a j k , k + 1 ) | j 1 j k S k } . Then, for any x C 2 and any y D , we have x y in G ( T ) , and so C 2 D V 2 , since D is a dominating set of G ( T ) and C 2 V 2 . Hence, | D V 2 | | C 2 | k ! = ( m 1 ) ! 2 m 2 > m , since k = m 1 and m 4 , which is a contradiction with | D V 2 | = m .
Therefore, we conclude that γ ( G ( T ) ) 2 m . □
Theorem 2. 
Let m be a positive integer with m 4 , p 1 < p 2 < < p m are primes and n = p 1 α 1 p 2 α 2 p m α m , where α i is a positive integer for each i { 1 , 2 , , m } . Using the division algorithm, there is a unique pair of non-negative integers q and r such that
m = ( p 1 1 ) q + r
where 0 r < p 1 1 .
(i) 
If p 1 = 2 and α 1 α 2 α m = 1 , then 2 m γ ( G ( Z n ) ) 2 γ ( G ( Z p 2 Z p m ) .
(ii) 
If p 1 = 2 and α 1 α 2 α m > 1 , then 2 γ t ( G ¯ ( Z p 2 Z p m ) γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) 2 γ t ( G ( Z p 2 Z p m ) .
(iii) 
If 3 p 1 m and p 2 p 1 p 1 1 m , then
γ ( G ( Z n ) ) = γ t ( G ¯ ( Z n ) ) = γ t ( G ( Z n ) ) = p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .
(iv) 
If p 1 m + 1 , then γ ( G ( Z n ) ) = γ t ( G ¯ ( Z n ) ) = γ t ( G ( Z n ) ) = m + 1 .
(v) 
If p 1 = 2 and p 2 m 4 , then γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = 2 m .
Proof. 
Let m and n be as given in the Theorem. Then, Z n Z p 1 α 1 Z p 2 α 2 Z p m α m and Z n / J ( Z n ) Z p 1 Z p 2 Z p m .
(i) follows immediately from Lemma 18 and Lemma 25.
(ii) Let p 1 = 2 and α 1 α 2 α m > 1 . Then, 2 U ( Z n ) , which implies by Theorem 1 that γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) . In addition, by Lemma 19, we have
2 γ t ( G ¯ ( Z p 2 Z p m ) γ t ( G ( Z 2 Z p 2 Z p m ) 2 γ t ( G ( Z p 2 Z p m ) .
Thus, (ii) holds.
(iii) Let 3 p 1 m and p 2 p 1 p 1 1 m . If α 1 α 2 α m = 1 , then by Proposition 3, (iii) holds.
Assume that α 1 α 2 α m > 1 . By Theorem 1, we have γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) ) , and so by Proposition 3 we obtain
γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) )
= γ t ( G ( Z p 1 Z p 2 Z p m ) ) = p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .
It follows from Lemma 6 that γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) . Finally, by Lemma 15, we have
γ ( G ( Z n ) ) = γ t ( G ¯ ( Z n ) ) = γ t ( G ( Z n ) ) = p 1 q , i f r = 0 ; p 1 q + r + 1 , i f r 0 .
(iv) Let p 1 m + 1 . If α 1 α 2 α m = 1 , then by Proposition 1, (iv) holds.
Assume that α 1 α 2 α m > 1 . By Theorem 1, we have γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) ) , and so by Proposition 1 we obtain
γ ( G ( Z n ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p m ) ) = γ t ( G ( Z p 1 Z p 2 Z p m ) ) = m + 1
It follows from Lemma 6 that γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = m + 1 . Finally, by Lemma 15, we have γ ( G ( Z n ) ) = γ t ( G ¯ ( Z n ) ) = γ t ( G ( Z n ) ) = m + 1 .
(v) Let p 1 = 2 and p 2 m 4 . By Proposition 1 and Remark 9, we have
γ ( G ( Z p 2 Z p m ) = γ t ( G ¯ ( Z p 2 Z p m ) = γ t ( G ( Z p 2 Z p m ) ) = m ,
since p 2 m = ( m 1 ) + 1 .
If α 1 α 2 α m = 1 , then 2 m γ ( G ( Z n ) ) 2 γ ( G ( Z p 2 Z p m ) by Theorem 2 item (i), and so γ ( G ( Z n ) ) = 2 m by Equation (4). In addition, by Lemma 19 we have
2 γ t ( G ¯ ( Z p 2 Z p m ) γ t ( G ( Z 2 Z p 2 Z p m ) 2 γ t ( G ( Z p 2 Z p m ) .
It follows from Equation (4) that γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) = 2 m .
If α 1 α 2 α m > 1 , then γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) = γ t ( G ( Z 2 Z p 2 Z p m ) = 2 m by Theorem 1. □
Remark 10. 
In Theorem 2, (ii) holds true for all positive integers m 2 by the proof of (ii).
Theorem 2 (iv) also holds true when m = 3 , since Proposition 1 also holds true when m = 3 by Remark 9. But Theorem 2 (i) is not true when m = 3 , since γ ( G ( Z 2 Z 3 Z 5 ) = 4 by Lemma 11, but 2 m = 6 .
As for Theorem 2 (iii), when m = 3 , then p 1 = 3 and q = r = 1 , since 3 p 1 m and m = ( p 1 1 ) + 1 . By Corollary 3 (viii) and (ix), we have
γ t ( G ¯ ( Z n ) ) = γ t ( G ( Z n ) ) = 5 = p 1 q + r + 1
But γ ( G ( Z 3 Z 5 Z 7 ) = 4 5 = p 1 q + r + 1 by Lemma 11.
As for Theorem 2 (v), when m = 3 and p 1 = 2 , then γ t ( G ( Z n ) ) = 6 = 2 m by Corollary 3 (viii) and (ix), but γ ( G ( Z 2 Z 3 Z 5 ) = 4 6 = 2 m by Lemma 11.
In Theorem 2, we study several cases of the domination number and total dominating number of Z n . But there are still some situations that we have not fully considered; for example, 3 p 1 m p 2 < p 1 p 1 1 m and 3 p 1 < p 2 < m . As for the case of p 1 = 2 , we only provided a range, without providing an accurate value of the domination number and total dominating number, so this requires more in-depth research.

5. The Unit Graph of the Ring Z n Associated with Products of Four Residue Class Fields

In this section, we focus on studying the domination number and the total domination number of G ( Z n ) when n has exactly four prime divisors. In what follows, we always assume that S = Z p 1 Z p 2 Z p 3 Z p 4 , where p 1 < p 2 < p 3 < p 4 are primes.
Proposition 4. 
If p 1 = 2 , then γ ( G ( S ) ) = 8 , and γ t ( G ( S ) ) = 10 , i f p 2 = 3 ; 8 , i f p 2 > 3 .
Proof. 
Let p 1 = 2 . If p 2 > 3 , then p 2 5 > 4 , since p 2 is a prime. It follows from Theorem 2 (v) that γ ( G ( S ) ) = γ t ( G ( S ) ) = 8 .
If p 2 = 3 , then 8 γ ( G ( S ) 2 γ ( G ( Z p 2 Z p 3 Z p 4 ) ) = 8 by Theorem 2 (i) and Lemma 11. Thus, γ ( G ( S ) ) = 8 . As for γ t ( G ( S ) ) , by Lemma 19 we have
2 γ t ( G ¯ ( Z p 2 Z p 3 Z p 4 ) ) γ t ( G ( S ) ) 2 γ t ( G ( Z p 2 Z p 3 Z p 4 ) )
In addition, by Corollary 3 (ix), we obtain
γ t ( G ¯ ( Z p 2 Z p 3 Z p 4 ) ) = γ t ( G ( Z p 2 Z p 3 Z p 4 ) ) = 5
Hence, γ t ( G ( S ) ) = 10 . □
Proposition 5. 
If p 1 = 3 and p 2 = 5 , then γ ( G ( S ) ) = γ t ( G ¯ ( S ) ) = γ t ( G ( S ) ) = 7 .
Proof. 
Let p 1 = 3 and p 2 = 5 . Then, p 4 > p 3 7 . Put
D = { ( 0 , 1 , 1 , 1 ) , ( 0 , 2 , 2 , 2 ) , ( 0 , 3 , 3 , 3 ) , ( 1 , 0 , 0 , 0 ) , ( 1 , 2 , 2 , 2 ) , ( 2 , 3 , 3 , 3 ) , ( 2 , 4 , 4 , 4 ) } .
Then, D S . In addition, we have
P Z p 2 Z p 3 Z p 4 ( ( ( Z p 1 { 0 } ) Z p 2 Z p 3 Z p 4 ) D ) = { ( 0 , 0 , 0 ) , ( 2 , 2 , 2 ) , ( 3 , 3 , 3 ) , ( 4 , 4 , 4 ) } ,
P Z p 2 Z p 3 Z p 4 ( ( ( Z p 1 { 1 } ) Z p 2 Z p 3 Z p 4 ) D ) = { ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 3 , 3 , 3 ) , ( 4 , 4 , 4 ) } ,
and
P Z p 2 Z p 3 Z p 4 ( ( ( Z p 1 { 2 } ) Z p 2 Z p 3 Z p 4 ) D ) = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 3 , 3 , 3 ) }
are total dominating sets of G ( Z p 2 Z p 3 Z p 4 ) by Remark 9. It follows from Lemma 23 that D is a total dominating set of G ( S ) , and so γ ( G ( S ) ) γ t ( G ( S ) ) | D | = 7 by Remark 1.
Suppose that D = { ( a i , b i , c i , d i ) S | i = 1 , 2 , 3 , 4 , 5 , 6 } is a dominating set of G ( S ) , and without loss of generality, assume that P Z p 1 ( D ) = { a 1 , a 2 , , a t } , where 1 t 3 . Let
| P Z p 2 Z p 3 Z p 4 ( ( { a i } Z p 2 Z p 3 Z p 4 ) D ) | = k i , i = 1 , 2 , , t
and z i = ( j = 1 t k j ) k i , i = 1 , 2 , , t . Then, k 1 + + k t = | D | = 6 . Consider the following cases:
Case (1)  t = 1 . Then, | D | 2 · 4 1 = 7 by Lemma 22, a contradiction.
Case (2)  t = 2 , i.e., P Z p 1 ( D ) = { a 1 , a 2 } . Then, z 2 = ( k 1 + k 2 ) k 2 = k 1 < 4 or z 1 = ( k 1 + k 2 ) k 1 = k 2 < 4 , since k 1 + k 2 = | D | = 6 . It follows from Lemma 22 that | D | 7 , a contradiction.
Case (3)  t = 3 . Then, P Z p 1 ( D ) = { a 1 , a 2 , a 3 } = Z p 1 and k 1 + k 2 + k 3 = 6 .
We claim that k i = 2 for any i { 1 , 2 , 3 } . In fact, if k j 3 for some j { 1 , 2 , 3 } , then z j = ( k 1 + k 2 + k 3 ) k j = 6 k j 3 < 4 , and so | D | 7 by Lemma 22, a contradiction.
If k j = 1 for some j { 1 , 2 , 3 } , say k 1 = 1 , then k 2 + k 3 = 5 , since k 1 + k 2 + k 3 = 6 . It follows from the well-known pigeonhole principle [20] (Theorem 3.1.1) that k 2 3 or k 3 3 , which also gives a contradiction. Hence, k i = 2 for any i { 1 , 2 , 3 } . Without loss of generality, we can assume that
a 1 = a 4 = 1 , a 2 = a 5 = 1 and a 3 = a 6 = 0 in Z p 1 = Z 3
We will prove that b 1 , b 2 , b 3 , b 4 , b 5 and b 6 are mutually different.
Claim(i):  b 1 b 4 and b 2 b 5 .
Suppose, on the contrary, that b 1 = b 4 . If c 2 = c 5 , then for any x { ( 0 , b 1 , c 2 , d ) | d Z p 4 } and any y D , we have x y in G ( S ) , and so { ( 0 , b 1 , c 2 , d ) | d Z p 4 } D , since D is a dominating set of G ( S ) . Thus, | D | p 4 > p 3 7 , a contradiction. Hence, c 2 c 5 .
For any y D , we have ( 0 , b 1 , c 2 , d 5 ) y and ( 0 , b 1 , c 5 , d 2 ) y in G ( S ) , and so
{ ( 0 , b 1 , c 2 , d 5 ) , ( 0 , b 1 , c 5 , d 2 ) } D ,
since D is a dominating set of G ( S ) . It follows that
{ ( a 3 , b 3 , c 3 , d 3 ) , ( a 6 , b 6 , c 6 , d 6 ) } = { ( 0 , b 1 , c 2 , d 5 ) , ( 0 , b 1 , c 5 , d 2 ) } ,
since a 3 = a 6 = 0 .
Since a 1 = a 4 , b 1 = b 4 and ( a 1 , b 1 , c 1 , d 1 ) ( a 4 , b 4 , c 4 , d 4 ) , we have c 1 c 4 or d 1 d 4 . Let
Ψ = { ( 1 , b 1 , c 2 , d 5 ) , ( 1 , b 1 , c 5 , d 2 ) , ( 1 , b 1 , c 1 , d 4 ) , ( 1 , b 1 , c 4 , d 1 ) } .
Then, for any x Ψ and any y D , we have x y in G ( S ) , and so
Ψ D
since D is a dominating set of G ( S ) . Notice that | D |   = 6 , by (5) and (6), we immediately have
D = { v 1 , v 2 , v 3 , v 4 , v 5 , v 6 } ,
where v 1 = ( 0 , b 1 , c 2 , d 5 ) , v 2 = ( 0 , b 1 , c 5 , d 2 ) , v 3 = ( 1 , b 1 , c 2 , d 5 ) ,   v 4 = ( 1 , b 1 , c 5 , d 2 ) , v 5 = ( 1 , b 1 , c 1 , d 4 ) and v 6 = ( 1 , b 1 , c 4 , d 1 ) .
Let
Φ = { ( 0 , b 1 , c , d ) | c Z p 3 { c 2 , c 5 } , d Z p 4 } .
Then, Φ D = , and for any x Φ and any y D , we have x y in G ( S ) . This contradicts with the fact that D is a dominating set of G ( S ) . Thus, b 1 b 4 , and similarly we have b 2 b 5 .
Claim(ii):  b 3 b 6 .
Suppose, on the contrary, b 3 = b 6 . If c 2 = c 5 , then for any x { ( 1 , b 3 , c 2 , d ) | d Z p 4 } and any y D , we have x y in G ( S ) , and so { ( 1 , b 3 , c 2 , d ) | d Z p 4 } D , since D is a dominating set of G ( S ) . Thus, | D | p 4 > p 3 7 , a contradiction. Hence, c 2 c 5 .
For any y D , we have ( 1 , b 3 , c 2 , d 5 ) y and ( 1 , b 3 , c 5 , d 2 ) y in G ( S ) , and so
{ ( 1 , b 3 , c 2 , d 5 ) , ( 1 , b 3 , c 5 , d 2 ) } D .
since D is a dominating set of G ( S ) . Noticing that c 2 c 5 , we have ( 1 , b 3 , c 2 , d 5 ) ( 1 , b 3 , c 5 , d 2 ) , which implies that
{ ( a 2 , b 2 , c 2 , d 2 ) , ( a 5 , b 5 , c 5 , d 5 ) } = { ( 1 , b 3 , c 2 , d 5 ) , ( 1 , b 3 , c 5 , d 2 ) } ,
since a 2 = a 5 = 1 . It follows that b 2 = b 5 = b 3 , which contradicts with claim(i). Thus, b 3 b 6 .
Claim(iii):  b 1 { b 2 , b 5 } and b 4 { b 2 , b 5 } .
Suppose, on the contrary, that b 1 = b 2 . If c 4 = c 5 , then for any x { ( 0 , b 1 , c 4 , d ) | d Z p 4 } and any y D , we have x y in G ( S ) , and so { ( 0 , b 1 , c 4 , d ) | d Z p 4 } D , since D is a dominating set of G ( S ) . Thus, | D | p 4 > p 3 7 , a contradiction. Hence, c 4 c 5 .
For any y D , we have ( 0 , b 1 , c 4 , d 5 ) y and ( 0 , b 1 , c 5 , d 4 ) y in G ( S ) , and so
{ ( 0 , b 1 , c 4 , d 5 ) , ( 0 , b 1 , c 5 , d 4 ) } D ,
since D is a dominating set of G ( S ) . It follows that
{ ( a 3 , b 3 , c 3 , d 3 ) , ( a 6 , b 6 , c 6 , d 6 ) } = { ( 0 , b 1 , c 4 , d 5 ) , ( 0 , b 1 , c 5 , d 4 ) } ,
since c 4 c 5 and a 3 = a 6 = 0 . But then b 3 = b 6 = b 1 , which contradicts with claim(ii). Thus, b 1 b 2 . Similarly, we have b 1 b 5 , b 4 b 2 and b 4 b 5 .
Claim(iv):  b 3 { b 1 , b 2 , b 4 , b 5 } and b 6 { b 1 , b 2 , b 4 , b 5 } .
Suppose, on the contrary, that b 3 = b 1 . If c 4 = c 6 , then for any x { ( 1 , b 3 , c 4 , d ) | d Z p 4 } and any y D , we have x y G ( S ) , which implies that { ( 1 , b 3 , c 4 , d ) | d Z p 4 } D and so | D | p 4 > p 3 7 , a contradiction. Thus, c 4 c 6 .
For any y D , we have ( 1 , b 3 , c 4 , d 6 ) y and ( 1 , b 3 , c 6 , d 4 ) y . So
{ ( 1 , b 3 , c 4 , d 6 ) , ( 1 , b 3 , c 6 , d 4 ) } D .
It follows that
{ ( a 1 , b 1 , c 1 , d 1 ) , ( a 4 , b 4 , c 4 , d 4 ) } = { ( 1 , b 3 , c 4 , d 6 ) , ( 1 , b 3 , c 6 , d 4 ) } ,
since c 4 c 6 and a 1 = a 4 = 1 . But then b 1 = b 4 = b 3 , which contradicts with Claim (i). Similarly, we have b 3 { b 2 , b 4 , b 5 } and b 6 { b 1 , b 2 , b 4 , b 5 } .
By claims (i), (ii), (iii), and (iv), we obtain that b 1 , b 2 , b 3 , b 4 , b 5 and b 6 are mutually different elements in Z 5 , a contradiction. Thus, 7 γ ( G ( S ) ) γ t ( G ( S ) ) 7 . It follows by Lemma 15 that γ ( G ( S ) ) = γ t ( G ¯ ( S ) ) = γ t ( G ( S ) ) = 7 . □
Combining the above results, we obtain the main theorem.
Theorem 3. 
Let R = Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 Z p 4 α 4 , where p 1 < p 2 < p 3 < p 4 are primes, α i is a positive integer for each i { 1 , 2 , 3 , 4 } . Then, we have the following:
(i) 
If p 1 = 2 and α 1 α 2 α 3 α 4 = 1 , then γ ( G ( R ) ) = 8 , and γ t ( G ( R ) ) = 10 , i f p 2 = 3 ; 8 , i f p 2 > 3 .
(ii) 
If p 1 = 2 and α 1 α 2 α 3 α 4 > 1 , then γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 10 , i f p 2 = 3 ; 8 , i f p 2 > 3 .
(iii) 
If p 1 3 , then γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 7 , i f p 1 = 3 a n d p 2 = 5 ; 6 , i f p 1 = 3 a n d p 2 > 5 ; 5 , i f p 1 > 3 .
Proof. 
(i) follows immediately from Proposition 4.
(ii) follows immediately from Corollary 3 (vii), Lemma 15 and Theorem 3 item (i).
(iii) Assume that p 1 3 . Firstly, let α 1 α 2 α 3 α 4 = 1 .
If p 1 > 3 , then p 1 5 = 4 + 1 , and so γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 5 by Proposition 1.
If p 1 = 3 and p 2 > 5 , then p 2 7 > 6 = p 1 p 1 1 · 4 , and so γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 2 p 1 = 6 by Proposition 3, since 4 = ( p 1 1 ) · 2 .
If p 1 = 3 and p 2 = 5 , then γ ( G ( R ) ) = γ t ( G ¯ ( R ) ) = γ t ( G ( R ) ) = 7 by Proposition 5.
Finally, assume that α 1 α 2 α 3 α 4 > 1 . Then, γ ( G ( R ) ) = γ t ( G ¯ ( Z p 1 Z p 2 Z p 3 Z p 4 ) ) by Theorem 1. By Lemma 6 and the case of α 1 α 2 α 3 α 4 = 1 , we have
γ ( G ( R ) ) = γ t ( G ( R ) ) = γ t ( G ¯ ( R ) ) = 7 , i f p 1 = 3 a n d p 2 = 5 ; 6 , i f p 1 = 3 a n d p 2 > 5 ; 5 , i f p 1 > 3 .
Remark 11. 
For Theorem 1, we have not yet investigated whether it applies to an arbitrary ring, especially noncommutative rings, which is also a research topic worth exploring. In addition, we recall the question of [16] (remark): Is γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) for all n?
If Z n is directly decomposed into certain fields, then the answer is negative. For example,
(i) 
n is a prime, then γ ( G ( Z n ) ) = 1 and γ t ( G ( Z n ) ) = 2 by Corollary 3 (ii).
(ii) 
n = 2 p , where p is a prime, then γ ( G ( Z n ) ) = 2 and γ t ( G ( Z n ) ) = 4 by Corollary 3 (vi).
(iii) 
n = 3 p 2 p 3 , where 3 < p 2 < p 3 are primes, then γ ( G ( Z n ) ) = 4 and γ t ( G ( Z n ) ) = 5 by Corollary 3 (ix).
(iv) 
n = 2 · 3 p 3 p 4 , where 3 < p 3 < p 4 are primes, then γ ( G ( Z n ) ) = 8 and γ t ( G ( Z n ) ) = 10 by Proposition 4.
Here is a special situation, using Theorem 2 (i) and (ii), we find that the domination number and total dominating number of G ( Z 2 Z p 2 Z p m ) are linked to the domination number and total dominating number of G ( Z p 2 Z p m ) , where 2 < p 2 < p 3 < < p m are primes.
In addition, from the proof of Lemma 19 and Proposition 4, we know it is the fact that γ ( G ( Z 2 Z p ) ) γ t ( G ( Z 2 Z p ) ) is caused by γ ( G ( Z p ) ) γ t ( G ( Z p ) ) , γ ( G ( Z 2 Z 3 Z p 3 Z p 4 ) ) γ t ( G ( Z 2 Z 3 Z p 3 Z p 4 ) ) is caused by γ ( G ( Z 3 Z p 3 Z p 4 ) ) γ t ( G ( Z 3 Z p 3 Z p 4 ) ) . However, by Theorem 2 (iii) and (iv), we know that γ ( G ( Z p 1 Z p m ) ) = γ t ( G ( Z p 1 Z p m ) ) when m 4 , p 1 3 and p 2 p 1 p 1 1 m .
So we modify the question of [16] (remark) using the following problems:
Open problem 1: Is γ ( G ( Z n ) = γ t ( G ( Z n ) ) when n = p 1 p 2 p m , where m 5 and p 1 < p 2 < < p m are primes?
In fact, as for the open problem 1, we only need to study the following cases for Theorem 2:
(i) 
p 1 = 2 and p 2 < m ;
(ii) 
3 p 1 m p 2 < p 1 p 1 1 m ;
(iii) 
3 p 1 < p 2 < m .
Open problem 2: is γ ( G ( R ) ) = γ t ( G ( R ) ) when | J ( R ) | > 1 ? In particular, is γ ( G ( Z n ) ) = γ t ( G ( Z n ) ) when | J ( Z n ) | > 1 ?
As for open problem 2, we have γ ( G ( R ) ) = γ t ( G ¯ ( R / J ( R ) ) ) by Theorem 1 and γ ( G ( R ) ) γ t ( G ( R ) ) γ t ( G ( R / J ( R ) ) ) by Lemma 6. So, if one prove that γ t ( G ( R / J ( R ) ) ) = γ t ( G ¯ ( R / J ( R ) ) ) , then the answer to problem 2 is positive. By Lemma 15, we have γ t ( G ¯ ( R / J ( R ) ) ) γ t ( G ( R / J ( R ) ) ) . But we do not know whether γ t ( G ¯ ( R / J ( R ) ) ) γ t ( G ( R / J ( R ) ) ) .
In particular, is γ t ( G ( Z n ) ) = γ t ( G ¯ ( Z n ) ) when Z n is directly decomposed into some fields? Regarding this question, with Theorem 3 we can assume that n = p 1 p 2 p m , m 5 and p 1 < p 2 < < p m are primes, and consider the following cases by Theorem 2:
(i) 
3 p 1 m p 2 < p 1 p 1 1 m ;
(ii) 
3 p 1 < p 2 < m .
Notice that a γ t -set of G ¯ ( Z p 1 Z p 2 Z p m ) may be not a total dominating set of G ( Z p 1 Z p 2 Z p m ) . For example, { 1 , 2 } is a γ t -set of G ¯ ( Z 3 ) , but { 1 , 2 } is not a total dominating set of G ( Z 3 ) . However, one can observe that { 0 , 1 } is a total dominating set of G ( Z 3 ) . So, how to construct a total dominating set of G ( Z p 1 Z p 2 Z p m ) is another problem.

Author Contributions

Writing—original draft, T.D.; Writing—review & editing, A.G. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (Grant No. 12171022).

Data Availability Statement

Data are contained within the article.

Acknowledgments

We thank the anonymous reviewers for their helpful suggestions.

Conflicts of Interest

The authors have no relevant financial or non- financial interests to disclose.

Appendix A

Lemma A1. 
Let M = Z 3 α 1 p 2 α 2 p 3 α 3 Z 3 α 1 Z p 2 α 2 Z p 3 α 3 , where 3 < p 2 < p 3 are primes, α 1 , α 2 , α 3 are positive integers and α 1 α 2 α 3 > 1 . Then M / J ( M ) Z 3 Z p 2 Z p 3 . In [16], Su et al. proved that
D = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 1 , 3 , 3 ) , ( 0 , 3 , 3 ) }
is a γ-set of G ( M ) . Next we prove that
D / J ( M ) = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 1 , 3 , 3 ) , ( 0 , 3 , 3 ) }
is a total dominating set of G ( M / J ( M ) ) , and hence γ t ( G ( M / J ( M ) ) ) 5 .
Proof. 
For any ( a 1 , a 2 , a 3 ) M / J ( M ) , we consider the following cases:
Case(i):  a 1 = 0 .
If a 2 1 and a 3 1 , then ( 0 , a 2 , a 3 ) ( 1 , 1 , 1 ) .
If a 2 = 1 , a 3 2 ; or a 3 = 1 , a 2 2 , then ( 0 , a 2 , a 3 ) ( 2 , 2 , 2 ) .
If a 2 = 1 , a 3 = 2 ; or a 3 = 1 , a 2 = 2 , then ( 0 , a 2 , a 3 ) ( 1 , 3 , 3 ) .
Case(ii):  a 1 = 1 .
If a 2 0 and a 3 0 , then ( 1 , a 2 , a 3 ) ( 0 , 0 , 0 ) .
If a 2 = 0 , a 3 1 ; or a 3 = 0 , a 2 1 , then ( 1 , a 2 , a 3 ) ( 1 , 1 , 1 ) .
If a 2 = 0 , a 3 = 1 ; or a 3 = 0 , a 2 = 1 , then ( 1 , a 2 , a 3 ) ( 1 , 3 , 3 ) .
Case(iii):  a 1 = 2 .
If a 2 0 and a 3 0 , then ( 2 , a 2 , a 3 ) ( 0 , 0 , 0 ) .
If a 2 = 0 , a 3 2 ; or a 3 = 0 , a 2 2 , then ( 2 , a 2 , a 3 ) ( 2 , 2 , 2 ) .
If a 2 = 0 , a 3 = 2 ; or a 3 = 0 , a 2 = 2 , then ( 2 , a 2 , a 3 ) ( 0 , 3 , 3 ) .
Thus, D / J ( M ) = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 1 , 3 , 3 ) , ( 0 , 3 , 3 ) } is a total dominating set of G ( M / J ( M ) ) . □
Lemma A2. 
Let M = Z p 1 α 1 p 2 α 2 p 3 α 3 Z p 1 α 1 Z p 2 α 2 Z p 3 α 3 , where 3 < p 1 < p 2 < p 3 are primes, α 1 , α 2 , α 3 are positive integers and α 1 α 2 α 3 > 1 . Then, M / J ( M ) Z p 1 Z p 2 Z p 3 by Remark 3. In [16], Su et al. proved that
D = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 3 , 3 , 3 ) }
is a γ-set of G ( M ) . Next, we prove that
D / J ( M ) = { ( 0 , 0 , 0 ) , ( 1 , 1 , 1 ) , ( 2 , 2 , 2 ) , ( 3 , 3 , 3 ) }
is a total dominating set of G ( M / J ( M ) ) , and hence γ t ( G ( M / J ( M ) ) ) 4 .
Proof. 
The conclusion can be obtained immediately by Remark 9. □

References

  1. Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
  2. Grimaldi, R.P. Graphs from rings. Proceedings of the 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing, (Boca Raton, FL,1989). Congr. Numer. 1990, 71, 95–103. [Google Scholar]
  3. Atiyah, M.F.; MacDonald, I.G. Introduction To Commutative Algebra, 1st ed.; CRC Press: Boca Raton, FL, USA, 1969. [Google Scholar] [CrossRef]
  4. Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Necessary and sufficient conditions for unit graphs to be Hamiltonian. Pacific J. Math. 2011, 249, 419–429. [Google Scholar] [CrossRef]
  5. Heydari, F.; Nikmehr, M.J. The unit graph of a left Artinian ring. Acta Math. Hungar. 2013, 139, 134–146. [Google Scholar] [CrossRef]
  6. Afkhami, M.; Khosh-Ahang, F. Unit graphs of rings of polynomials and power series. Arab. J. Math. 2013, 2, 233–246. [Google Scholar] [CrossRef]
  7. Li, Z.; Su, H.D. The radius of unit graphs of rings. Aims Math. 2021, 6, 11508–11515. [Google Scholar] [CrossRef]
  8. Su, H.D.; Tang, G.; Zhou, Y. Rings whose unit graphs are planar. Publ. Math. Debr. 2015, 86, 363–376. [Google Scholar] [CrossRef]
  9. Su, H.D.; Noguchi, K.; Zhou, Y. Finite commutative rings with higher genus unit graphs. J. Algebra Appl. 2015, 14, 1550002. [Google Scholar] [CrossRef]
  10. Su, H.D.; Wei, Y. The dimaeter of unit graphs of rings. Taiwan J. Math. 2019, 23, 1–10. [Google Scholar] [CrossRef]
  11. Su, H.D.; Zhou, Y. On the girth of the unit graph of a ring. J. Algebra Appl. 2014, 13, 1350082. [Google Scholar] [CrossRef]
  12. Ashrafi, N.; Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Unit Graphs associated with rings. Commun. Algebra 2010, 38, 2851–2871. [Google Scholar] [CrossRef]
  13. Anderson, D.F.; Asir, T.; Badawi, A.; Chelvam, T.T. Graphs from Rings; Springer: Cham, Switzerland, 2021. [Google Scholar]
  14. Mekis, G. Lower bounds for the domination number and the total domination number of direct product graphs. Discret. Math. 2010, 310, 3310–3317. [Google Scholar] [CrossRef]
  15. Kiani, S.; Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Classification of rings with unit graphs having domination number less than four. Rendiconti del Seminario Matematico Della Universit di Padova 2015, 133, 173–195. [Google Scholar] [CrossRef]
  16. Su, H.D.; Yang, L.Y. Domination number of unit graph of Zn. Discret. Math. Algorithms Appl. 2020, 12, 2050059. [Google Scholar] [CrossRef]
  17. Lloyd, E.K.; Bondy, J.A.; Murty, U.S. Graph Theory with Applications; Macmillan: London, UK, 1976; Volume 290. [Google Scholar]
  18. Lam, T.-Y. A First Course in Noncommutative Rings; Springer: New York, NY, USA, 1991; Volume 131. [Google Scholar]
  19. Hungerford, T.W. Algebra; Springer Science and Business Media: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
  20. Brualdi, R.A. Introductory Combinatorics; Pearson: London, UK, 2009. [Google Scholar]
Figure 1. G ( Z 3 ) .
Figure 1. G ( Z 3 ) .
Axioms 14 00399 g001
Figure 2. G ¯ ( Z 3 ) .
Figure 2. G ¯ ( Z 3 ) .
Axioms 14 00399 g002
Figure 3. G ( Z 9 ) .
Figure 3. G ( Z 9 ) .
Axioms 14 00399 g003
Figure 4. G ( Z 4 Z 3 ) .
Figure 4. G ( Z 4 Z 3 ) .
Axioms 14 00399 g004
Figure 5. G ¯ ( Z 3 Z 5 ) .
Figure 5. G ¯ ( Z 3 Z 5 ) .
Axioms 14 00399 g005
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Du, T.; Gan, A. Domination Parameters of Unit Graphs of Rings. Axioms 2025, 14, 399. https://doi.org/10.3390/axioms14060399

AMA Style

Du T, Gan A. Domination Parameters of Unit Graphs of Rings. Axioms. 2025; 14(6):399. https://doi.org/10.3390/axioms14060399

Chicago/Turabian Style

Du, Ting, and Aiping Gan. 2025. "Domination Parameters of Unit Graphs of Rings" Axioms 14, no. 6: 399. https://doi.org/10.3390/axioms14060399

APA Style

Du, T., & Gan, A. (2025). Domination Parameters of Unit Graphs of Rings. Axioms, 14(6), 399. https://doi.org/10.3390/axioms14060399

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop