Next Article in Journal
Tour Route Recommendation Model by the Improved Symmetry-Based Naive Bayes Mining and Spatial Decision Forest Search
Next Article in Special Issue
Directed Path 3-Arc-Connectivity of Cartesian Product Digraphs
Previous Article in Journal
Mechanism Study of Symmetric Mechanism-Rolling Bearing Dynamic System Considering the Influence of Temperature Factor
Previous Article in Special Issue
The Chromatic Entropy of Linear Supertrees and Its Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Classification of Genus Three Zero-Divisor Graphs

1
Department of Mathematics, Pondicherry University, Pondicherry 605 014, India
2
Department of Mathematics, Fatima College, Madurai 625 018, India
3
Department of Mathematics, College of Science, King Saud University, Riyadh 11451, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(12), 2167; https://doi.org/10.3390/sym15122167
Submission received: 17 October 2023 / Revised: 28 November 2023 / Accepted: 1 December 2023 / Published: 6 December 2023
(This article belongs to the Special Issue Advances in Graph Theory)

Abstract

:
In this paper, we consider the problem of classifying commutative rings according to the genus number of its associating zero-divisor graphs. The zero-divisor graph of R, where R is a commutative ring with nonzero identity, denoted by Γ ( R ) , is the undirected graph whose vertices are the nonzero zero-divisors of R, and the distinct vertices x and y are adjacent if and only if x y = 0 . Here, we classify the local rings with genus three zero-divisor graphs.
MSC:
13A15; 13M05; 05C75; 05C25

1. Introduction

Studying algebraic structures using graph theory properties has been an exciting research topic in the last two decades. Beck [1], who created the concept of a zero-divisor graph of a commutative ring with identity, established the connection between algebra and graph theory by linking a graph with a ring in 1988. In Beck’s definition, the vertices of the graph are the elements of the ring and two distinct vertices x and y are adjacent if and only if x y = 0 . Beck’s graph had edges between zero-divisors to emphasize them, but it also had an edge connecting each element to zero. Later, Anderson and Livingston [2] in 1999 made a slight modification to this concept by only taking into account the nonzero zero-divisors of a ring as vertices of the graph with the same adjacency criterion. For more details on zero-divisor graphs, one may refer to [3].
In recent decades, many geometrical properties of graphs were widely investigated. More precisely, the study focused on the oriented and non-oriented genus of graphs that originate from algebraic ones. The question of which commutative rings have planar zero-divisor graphs was raised by Anderson et al. [4] in 2001. Since then, the literature has been keenly interested in zero-divisor graph embedding. Numerous academics have so far classified all commutative rings with zero-divisor graphs having a genus less than or equal to two in several research articles. The planar zero-divisor graphs were explicitly characterized by Smith [5,6] and Belshoff [7], while the characterization of commutative rings with genus one zero-divisor graphs was obtained by Chiang-Hsieh et al. in [8] and local rings with genus two zero-divisor graphs were characterized by Bloomfied et al. in [9]. Furthermore, Asir et al. [10] have determined all non-local commutative rings with genus two zero-divisor graphs. All commutative rings with projective (non-oriented genus one) zero-divisor graphs were characterized by Chiang-Hsieh [11]. Moreover, Asir et al. [12] determined all commutative rings with crosscap two zero-divisor graphs. One may refer to Chapter 4 of [3] for the complete literature evaluation.
This paper aims to investigate the problem of embedding zero-divisors on higher-genus orientable surfaces. This paper is structured as follows: In Section 2, definitions and tools are developed to aid classification. In Section 3 and Section 4, all commutative rings with genus three zero-divisor graphs are determined.
Let R be a commutative ring with nonzero identity and Z ( R ) be its set of zero-divisors for the course of this paper. We use Z n to represent the ring of integers modulo n, F q to represent the finite field with q elements, | A | to represent the cardinality of the set A and A * to represent the set of all non-zero elements of A. We denote the complete bipartite graph with parts of size m and n by K m , n , and the complete graph with n vertices by K n . K n ¯ is the complement of the complete graph K n . The notation d e g ( v ) and δ ( G ) indicate the degree of a vertex v in a graph G and the minimum degree of G, respectively. The Cartesian product  G = G 1 G 2 is a graph with vertex set V ( G ) = V ( G 1 ) × V ( G 2 ) , and two distinct vertices ( u 1 , u 2 ) and ( v 1 , v 2 ) of G are adjacent if and only if either u 1 = v 1 and u 2 v 2 E ( G 2 ) or u 2 = v 2 and u 1 v 1 E ( G 1 ) . The join  G = G 1 G 2 of graphs G 1 and G 2 with disjoint vertex sets V 1 and V 2 and edge sets E 1 and E 2 is the graph union G 1 and union G 2 together with all the edges joining V 1 and V 2 .
For non-negative integers and k, let S denote the sphere with handles and N k denote a sphere with k crosscaps attached to it. For a simple graph G, the minimum such that G can be embedded in S is its genus which is denoted by γ ( G ) . Similarly, the minimum k such that G can be embedded in N k is γ ˜ ( G ) , or crosscap number (non-orientable genus). Planar, toroidal and double toroidal graphs are the terms used to refer to the graphs of genus 0, 1 and 2, respectively. The graph that is obtained from G x y by identifying vertices x and y to create a new vertex z incident with all edges of G that were incident with either x or y is known as the contraction of e in G, denoted as [ x , y ] . This is the case if e = x y E ( G ) . If H can be obtained from G by deleting vertices, edges and contracting edges, then H is a minor of G, written H G . The graph G ˜ denotes the induced subgraph of G induced by the vertices G V where V = { v V : d e g ( v ) 2 } and we call this graph the reduction in G. It is clear that γ ( G ˜ ) = γ ( G ) for any graph G. For details on the notion of embedding of graphs on a surface, we refer to White [13].
For convenience, we denote the elements of the ring Z n [ x ] / ( x 2 ) simply by { a 0 + a 1 x : a 0 , a 1 Z n } . In other words, we avoid writing the fixed last term ( x 2 ) in each element of the ring. Similarly, the ring Z n [ x , y ] / ( x 3 , x y , y 2 ) simply by { a 0 + a 1 x + a 2 x 2 + a 3 y : a 0 , a 1 , a 2 , a 3 Z n } .

2. Genus Properties of Graphs

We now state a few results regarding the genus of the graph which will be used to prove the main results of this paper.
Proposition 1 
([14]). Let n 3 be a positive integer and, for any real number x, the ceiling function x is the least integer that is greater than or equal to x. Then, γ ( K n ) = ( n 3 ) ( n 4 ) 12 .
Proposition 2 
([14]). Let m , n be positive integers. Then, γ ( K m , n ) = ( m 2 ) ( n 2 ) 4 if m , n 2 .
Proposition 3 
([14] (Euler formula)). If G is a finite connected graph with n vertices and m edges; then,
n m + f = 2 2 γ
where the graph is embedded upon a surface S γ with genus γ and f is the number of faces created when G is embedded on S γ .
Remark 1 
([15]). For any embedded graph G with v vertices, e edges and f faces, we have 2 e g ( G ) · f where g ( G ) denotes the girth of G (i.e., the length of the shortest cycle in G ) .
By Proposition 3 and Remark 3, one can obtain the following result.
Remark 2.
If G is a triangle-free graph with n vertices and m edges, then
γ ( G ) m 4 n 2 + 1 .
Proposition 4 
([16], Theorem 2). The complete bipartite graph K m , n has a two-cell embedding on a compact orientable two-manifold S γ of genus γ if and only if
( m 2 ) ( n 2 ) 4 γ ( m 1 ) ( n 1 ) 2 .
Proposition 5 
([13], Proposition 2.1). If G is a graph with n vertices and genus γ, then
δ ( G ) 6 + 12 γ 12 n .
Proposition 6 
([9], Lemma 4). Let ( R , m ) be a local ring with m principal and with an index of nilpotency n, and let 1 k < n . For every z M k M k + 1 , A n n ( z ) = A n n ( M k ) .
Proposition 7 
([9], Lemma 5). Let ( R , m ) be a local ring such that m = ( x , y 1 , , y k 2 ) and m 2 = ( x 2 ) for some k 2 . Then, there exist elements y 1 , , y k 2 m such that m = ( x , y 1 , , y k 2 ) and x y i = 0 .
Proposition 8 
([9], Lemma 6). Let ( R , m ) be a local ring such that m = ( x , y , z 1 , , z k 2 ) and m 2 = ( x y ) for some k 3 . Then, there exist elements z 1 , , z k 2 m such that m = ( x , y , z 1 , , z k 2 ) and x z i = 0 .

3. Classification of Genus Three Zero-Divisor Graphs

We will now state a few results regarding the genus properties of a zero-divisor graph of a commutative ring which will be further used to prove the main result.
Theorem 1 
([8], Theorem 3.5.1). Let ( R , m ) be a finite local ring which is not a field. Then, Γ ( R ) is planar if and only if R is isomorphic to one of the following 29 rings:
Z 4 , Z 8 , Z 9 , Z 16 , Z 25 , Z 27 , Z 2 [ x ] / ( x 2 ) , Z 2 [ x ] / ( x 3 ) , Z 2 [ x ] / ( x 4 ) , Z 2 [ x , y ] / ( x 2 , y 2 ) , Z 2 [ x , y ] / ( x 2 , x y , y 2 ) , Z 2 [ x , y ] / ( x 3 , x y , y 2 x 2 ) , F 4 [ x ] / ( x 2 ) , Z 3 [ x ] / ( x 2 ) , Z 3 [ x ] / ( x 3 ) , Z 4 [ x ] / ( x 2 ) , Z 4 [ x ] / ( x 2 + x + 1 ) , Z 4 [ x ] / ( 2 x , x 2 ) , Z 4 [ x ] / ( x 2 2 , x 4 ) , Z 4 [ x ] / ( x 3 2 , x 4 ) , Z 4 [ x ] / ( x 2 2 , x 3 ) , Z 4 [ x ] / ( x 3 , x 2 2 x ) , Z 4 [ x ] / ( x 3 + x 2 2 , x 4 ) , Z 4 [ x , y ] / ( x 2 , y 2 , x y 2 ) , Z 4 [ x , y ] / ( x 3 , x 2 2 , x y , y 2 2 , y 3 ) , Z 5 [ x ] / ( x 2 ) , Z 8 [ x ] / ( x 2 4 , 2 x ) , Z 9 [ x ] / ( x 2 3 , x 3 ) , Z 9 [ x ] / ( x 2 + 3 , x 3 ) .
Theorem 2 
([8], Theorem 3.5.2). Let ( R , m ) be a finite local ring which is not a field. Then, γ ( Γ ( R ) ) = 1 if and only if R is isomorphic to one of the following 17 rings:
Z 32 , Z 49 , Z 2 [ x ] / ( x 5 ) , F 8 [ x ] / ( x 2 ) , Z 2 [ x , y ] / ( x 3 , x y , y 2 ) , Z 2 [ x , y , z ] / ( x , y , z ) 2 , Z 4 [ x ] / ( x 3 + x + 1 ) , Z 4 [ x ] / ( x 3 2 , x 5 ) , Z 4 [ x ] / ( x 4 2 , x 5 ) , Z 4 [ x , y ] / ( x 3 , x 2 2 , x y , y 2 ) , Z 4 [ x ] / ( x 3 , 2 x ) , Z 4 [ x , y ] / ( 2 x , 2 y , x 2 , x y , y 2 ) , Z 7 [ x ] / ( x 2 ) , Z 8 [ x ] / ( x 2 , 2 x ) , Z 8 [ x ] / ( x 2 2 , x 5 ) , Z 8 [ x ] / ( x 2 + 2 x 2 , x 5 ) , Z 8 [ x ] / ( x 2 2 x + 2 , x 5 ) .
As mentioned earlier, Bloomfield and Wickham [9] enumerated the local commutative rings whose zero-divisor graphs have genus two. The relevant result is stated below.
Theorem 3 
([9], Theorem 1). Let ( R , m ) be a finite local ring which is not a field. Then, γ ( Γ ( R ) ) = 2 if and only if R is isomorphic to one of the following 14 local rings.
Z 81 , F 3 [ x ] / ( x 4 ) , Z 9 [ x ] / ( 3 x , x 3 3 ) , Z 9 [ x ] / ( x 2 3 ) , Z 9 [ x ] / ( x 2 6 ) , Z 9 [ x , y ] / ( x , y ) 2 , Z 9 [ x ] / ( 3 x , x 2 ) , F 9 [ x ] / ( x 2 ) , F 2 [ x , y ] / ( x 4 , x y , y 2 x 3 ) , Z 4 [ x , y ] / ( x 2 2 , x y , y 2 2 x , 2 y ) , Z 9 [ x ] / ( x 2 + 1 ) , Z 4 [ x , y ] / ( x 3 2 , x y , 2 x , y 2 2 ) , Z 8 [ x ] / ( 2 x , x 3 4 ) , Z 16 [ x ] / ( 2 x , x 2 8 ) .
First, we provide some results needed to classify the genus three zero-divisor graphs.
Theorem 4.
Let ( R , m ) be a finite local ring. If γ ( Γ ( R ) ) = 3 , then | R / m | 4 ; and the following holds:
(i)
If | R / m | = 4 , then m 3 = 0 and | R | = 64 ;
(ii)
If | R / m | = 3 , then m 4 = 0 and | R | = 81 ;
(iii)
If | R / m | = 2 , then m 6 = 0 and | R | = 64 or 32.
Proof. 
Assume that γ ( Γ ( R ) ) = 3 . Since R is local, there is a prime power q and integers s > r such that | R | = q s , | m | = q r and | R / m | = q . Let t be a largest positive integer such that m t 0 . Therefore, m t + 1 = 0 .
Suppose that q > 9 . Then, | m t m t + 1 |   10 . Since m t · m t = 0 , we have x y = 0 for every x , y m t . Therefore, the subgraph induced by m t in Γ ( R ) is complete and so K 10 Γ ( R ) . Thus, by Proposition 2, γ ( Γ ( R ) ) 4 is a contradiction. Hence, | R / m | 9 .
Case 1: Suppose 5 q 9 . The possibilities for q are 5 , 7 , 8 or 9. If t 2 , then | m t m t + 1 |   4 and | m t 1 m t |   20 . Since m t 1 · m t = 0 , every element of m t 1 is adjacent to all the elements of m t in Γ ( R ) . So K 4 , 20 Γ ( R ) and by Proposition 2, we obtain γ ( Γ ( R ) ) 9 . Therefore, t = 1 . That is, m 2 = 0 . If d i m R / m m / m 2 2 , then | m | q 2 . Since the collection of non-zero elements of m form a complete graph in Γ ( R ) and q 2 1 24 , we have K 24 Γ ( R ) , a contradiction. Therefore, m is a principal ideal and | m | = q . In this case, Γ ( R ) = K q 1 . The assumption γ ( Γ ( R ) ) = 3 implies that q = 10 , a contradiction.
Case 2: Suppose q = 4 . If t 3 , then | m t |   4 . This statement implies that | m t m t + 1 |   3 and | m t 2 m t |   28 . Since m t 2 · m t = 0 , K 3 , 28 Γ ( R ) so that γ ( Γ ( R ) ) 7 , a contradiction. Thus, t 2 . That is, m 3 = 0 .
Moreover, suppose that | R | = 4 for some 4 . Here, | m | = 4 1 64 . If m 2 = 0 , then the subgraph induced by m forms a complete graph in Γ ( R ) , which leads to K 63 Γ ( R ) , a contradiction. If m 2 0 , then | m 2 |   4 and m · m 2 = 0 . This implies that K 3 , 60 Γ ( R ) , a contradiction. Therefore, t 3 means that | R | 64 . But by Theorems 1 and 2, the zero-divisor graph of any local ring of order less than or equal to 16 has a genus less than 2. Thus, | R | = 64 .
Case 3: Suppose q = 3 . If t 4 , then | m t 1 m t |   6 and | m t 2 m t 1 |   18 . Since m t 1 · m t 2 = 0 , K 6 , 18 Γ ( R ) , a contradiction. Therefore, t 3 . Hence, m 4 = 0 .
Suppose that | R | = 3 for some 5 . This implies that | m | = 3 1 81 .
Case 3.1: If m 2 = 0 , then the subgraph induced by m * is complete in Γ ( R ) , leading to K 80 Γ ( R ) , a contradiction.
Case 3.2: If m 3 = 0 , then | m 2 |   3 . Let | m 2 |   = k 9 . Since m 2 · m = 0 , we have K k 1 , 81 k Γ ( R ) , a contradiction. Therefore, | m 2 |   = 3 and so d i m R / m m / m 2 = 2 3 . Now, by Proposition 2.8 [17], m = ( x , y 1 , , y 3 ) for some x , y i m m 2 . Without loss of generality, we may assume that either m 2 = ( x 2 ) or m 2 = ( x y 1 ) .
Assume that m 2 = ( x 2 ) . Then by Proposition 7, x y i = 0 for 1 i 3 . Since { y 1 + m 2 } { 2 y 1 + m 2 } = and { x + m 2 } { 2 x + m 2 } { m 2 } = , we have the sets y 1 + m 2 2 y 1 + m 2 and x + m 2 2 x + m 2 m 2 * which form K 6 , 8 in Γ ( R ) . Therefore γ ( Γ ( R ) ) 6 .
Assume that m 2 = ( x y 1 ) . Since any element of m 2 m 3 generates m 2 , we may assume that x 2 , y i 2 m 3 = 0 . Now, the cosets m 2 , x + m 2 , 2 x + m 2 , y 1 + m 2 , 2 y 1 + m 2 , y 2 + m 2 and 2 y 2 + m 2 are mutually disjoint. In particular, 2 x 0 and 2 y 0 . Let A = m 2 * x + m 2 2 x + m 2 , B = y 1 + m 2 2 y 1 + m 2 and C = y 2 + m 2 2 y 2 + m 2 so that | A | = 8 , | B | = 6 and | C | = 6 . Therefore, in Γ ( R ) , the subgraph induced by the set A is isomorphic to K 8 , and the subgraph induced by the sets B and C is isomorphic to K 6 . Thus, 2 K 6 K 8 Γ ( R ) so that γ ( Γ ( R ) ) 4 .
Case 3.3: If m 4 = 0 , then | m 3 |   3 and | m 2 |   9 . Let | m 3 |   = k 9 . Then, Γ ( R ) contains K k 1 , 81 k as a subgraph, a contradiction. Therefore, | m 3 |   = 3 and | m 2 |   = 9 . Consequently, d i m R / m m / m 2 = 3 2 . Then, by Proposition 2.8 [17], m = ( x , y 1 , , y 4 ) for some x , y i m m 2 . So we may assume that m 2 = ( x 2 ) or m 2 = ( x y 1 ) .
Assume that m 2 = ( x 2 ) . Then, by Proposition 7, x y i = 0 for every i. Notice that the cosets m 2 and y 1 + m 2 are mutually disjoint and every element in m 2 \ { 0 } is adjacent to all the elements of y 1 + m 2 in Γ ( R ) . So Γ ( R ) contains K 8 , 9 as a subgraph and thus γ ( Γ ( R ) ) 11 .
Assume that m 2 = ( x y 1 ) . Since any element of m 2 m 3 generates m 2 , we may assume that x 2 , y i 2 m 3 . Clearly, m 2 y 1 + m 2 = . If a y 1 + m 2 and b m 2 , then a b = s x y 1 2 + r s x 2 y 1 2 for some r , s R . Since y 1 2 m 3 and x m , we have a b = 0 . Therefore, the subgraph induced by m 2 \ { 0 } y 1 + m 2 contains K 8 , 9 in Γ ( R ) and so γ ( Γ ( R ) ) 11 .
Thus, | R | = 3 with 4 . But by Theorems 1 and 3, γ ( Γ ( R ) ) 2 for all local rings R of order less than or equal to 27. Hence, | R | = 81 .
Case 4: Suppose q = 2 . If t 6 , then | m t 1 m t + 1 |   3 and | m t 4 m t 1 |   28 . Since m t 4 · m t 1 = 0 , we have K 3 , 28 Γ ( R ) so that γ ( Γ ( R ) ) 7 , a contradiction. Therefore, t 5 , which leads to m 6 = 0 .
Suppose that | R | = 2 for some 7 . Notice that | m | = 2 1 64 .
Case 4.1: If m 2 = 0 , then K 63 Γ ( R ) , a contradiction.
Case 4.2: If m 3 = 0 , then | m 2 |   2 . Let | m 2 |   = k 4 . Then, Γ ( R ) contains K k 1 , 64 k as a subgraph, a contradiction. Therefore, | m 2 |   = 2 and so d i m R / m m 2 / m = 2 5 . This implies that m = ( x , y 1 , , y 3 ) for x , y i m m 2 and without loss of generality, we may assume m 2 = ( x 2 ) or m 2 = ( x y 1 ) .
Assume that m 2 = ( x 2 ) . Then, by Proposition 7, we have x y i = 0 . Let u 1 = x , u 2 = x 2 , u 3 = x + x 2 , v 1 = y 1 , v 2 = y 1 + x 2 , v 3 = y 2 , v 4 = y 2 + x 2 , v 5 = y 3 , v 6 = y 3 + x 2 , v 7 = y 4 + x 2 , v 8 = y 1 + y 2 , v 9 = y 1 + y 3 , v 10 = y 1 + y 4 , v 11 = y 2 + y 3 , v 12 = y 2 + y 4 , v 13 = y 3 + y 4 , v 14 = y 1 + y 2 + y 3 , v 15 = y 2 + y 3 + y 4 and v 16 = y 1 + y 2 + y 3 + y 4 . Then, u i · v j = 0 for every i , j , so that K 3 , 16 Γ ( R ) , a contradiction.
Assume m 2 = ( x y 1 ) . Then, by Proposition 8, x y i = 0 for i 2 . Also, any element of m 2 m 3 generates m 2 and so we may assume that x 2 , y i 2 m 3 = 0 . Now, let u 1 = x , u 2 = x + x y 1 , u 3 = y 1 , u 4 = y 1 + x y 1 , u 5 = x + y 1 , u 6 = x + y 1 + x y 1 , and let v 1 = y 2 , v 2 = y 2 + x y 1 , v 3 = y 3 , v 4 = y 3 + x y 1 , v 5 = y 2 + y 3 , v 6 = y 2 + y 3 + x y 1 . Then, u i · v j = 0 for every i , j and therefore K 6 , 6 Γ ( R ) , a contradiction.
Case 4.3: If m 4 = 0 , then | m 3 |   2 and | m 2 |   4 . Let | m 3 |   = k 4 . Then, Γ ( R ) contains K k 1 , 64 k as a subgraph, a contradiction. Therefore, | m 3 |   = 2 and | m 2 |   = 4 . Consequently, d i m R / m m 2 / m = 3 4 . Now, by Proposition 2.8 [17], m = ( x , y 1 , , y 4 ) for some x , y i m m 2 , and without loss of generality, let m 2 = ( x 2 ) or m 2 = ( x y 1 ) . In either case, by Propositions 7 and 8, we have x y i = 0 for i 2 . Since | m 2 |   4 and m 2 · m 2 = 0 , we can choose two non-zero elements a , b m 2 such that a · b = 0 . Let u 1 = x , u 2 = x 2 , u 3 = a , u 4 = b , u 5 = x + x 2 , u 6 = x + a , u 7 = x + b and v 1 = y 2 , v 2 = y 3 , v 3 = y 2 + x 2 , v 4 = y 2 + a , v 5 = y 2 + b , v 6 = y 3 + x 2 , v 7 = y 3 + a , v 8 = y 3 + b . Clearly u i · v j = 0 for every i , j so that K 7 , 8 Γ ( R ) . By Proposition 2, γ ( Γ ( R ) ) 8 , a contradiction.
A similar proof technique is valid for the cases m 5 = 0 or m 6 = 0 .
Thus, 6 . But by Theorems 1 and 2, γ ( Γ ( R ) ) 1 for all local rings R of order less than or equal to 16. Hence, | R | = 32 or 64. □
Lemma 1 
([8] (Proposition 7.1), [5] (Proposition 5)). Let R be a local ring with maximal ideal m . Then, there are 54 local commutative rings with order 32.
F 32 , Z 32 , Z 2 [ x ] / ( x 5 ) , Z 2 [ x , y ] / ( x 4 , x y , y 2 x 3 ) , Z 2 [ x , y ] / ( x 4 , x y , y 2 ) , Z 2 [ x , y , z , t ] / ( x , y , z , t ) 2 , Z 2 [ x , y ] / ( x 3 , x 2 y , y 2 ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x y ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x 2 x y ) , Z 2 [ x , y , z ] / ( x 3 , y 2 , z 2 , x y , x z , y z ) , Z 2 [ x , y , z ] / ( y 2 x 2 , z 2 , x y , x z , y z ) , Z 2 [ x , y , z ] / ( y 2 x 2 , z 2 x 2 , x y , x z , y z ) , Z 2 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , y z ) , Z 4 [ x ] / ( 2 x , x 4 2 ) , Z 4 [ x ] / ( 2 x 2 , x 3 2 ) , Z 4 [ x , y ] / ( x 3 , y 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 + 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , y 2 + 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x y 2 , x 2 , y 2 + 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , x 2 + x y , y 2 + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 2 , y 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 2 , y 2 2 , x y , 2 x ) , Z 4 [ x ] / ( x 4 , 2 x ) , Z 4 [ x ] / ( x 3 , 2 x 2 ) ,
Z 4 [ x ] / ( x 3 2 x , 2 x 2 ) , Z 4 [ x , y ] / ( x 2 2 , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 2 , y 2 2 x , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 2 x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 , z 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , x z , y z 2 , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 , z 2 , x y , x z 2 , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 , x y , x z 2 , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y 2 , x z , y z , 2 x , 2 y , 2 z ) , Z 4 [ x , y ] / ( x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 , y 2 2 x , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 2 x , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( 2 , x , y , z ) 2 , Z 8 [ x ] / ( 2 x , x 3 ) , Z 8 [ x ] / ( 4 x , x 2 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x + 2 ) , Z 8 [ x ] / ( 2 x , x 3 4 ) , Z 8 [ x ] / ( 2 x , x 3 ) , Z 8 [ x ] / ( 4 x , x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x ) , Z 8 [ x ] / ( 4 x , x 2 2 x 4 ) , Z 8 [ x , y ] / ( x 2 , y 2 , x y , 2 x , 2 y ) , Z 8 [ x , y ] / ( x 2 4 , y 2 , x y , 2 x , 2 y ) , Z 8 [ x , y ] / ( x 2 4 , y 2 4 , x y , 2 x , 2 y ) , Z 8 [ x , y ] / ( x 2 , y 2 , x y 4 , 2 x , 2 y ) , Z 16 [ x ] / ( 2 x , x 2 ) , Z 16 [ x ] / ( 2 x , x 2 8 ) .
The graph given in Figure 1 plays a vital role in characterizing local rings with genus three zero-divisor graphs. Therefore, we find its genus value in the following result.
Lemma 2.
For a graph H as shown in Figure 1, we have γ ( Γ ( R ) ) = 3 .
Proof. 
In Figure 2, we provide an embedding of the graph H in the surface of S 3 . Thus, γ ( Γ ( H ) ) = 3 . □
Lemma 3.
Let ( R , m ) be a finite local ring and | R / m | = 4 . Then, γ ( Γ ( R ) ) = 3 if and only if | R | = 64 and m has a nilpotency index of 3.
Proof. 
(⇒): Suppose that γ ( Γ ( R ) ) = 3 . Then, by Theorem 4, we have | R | = 64 and m 3 = 0 . It follows that | m | = 16 . If m 2 = 0 , then any two non-zero element of m is adjacent in Γ ( R ) and so Γ ( R ) contains K 15 as a subgraph. Therefore, γ ( Γ ( R ) ) 10 , a contradiction. Thus, the nilpotency index of m is 3.
(⇐): Let | R | = 64 and the nilpotency index of m be 3. This implies that m 2 0 and | m 2 | = 4 . The facts m 2 0 , m · m 2 = 0 and m 2 · m 2 = 0 imply that, in Γ ( R ) , the subgraph induced by the set m m 2 is empty, every element in m m 2 is adjacent to all the element of m 2 and the subgraph induced by m 2 { 0 } is complete. Therefore, Γ ( R ) is isomorphic to K 12 ¯ K 3 . So Γ ( R ) is a subgraph of the graph H given in Figure 1. Thus, by Lemma 2, γ ( Γ ( R ) ) = 3 . □
Lemma 4.
Let ( R , m ) be a finite local ring and | R / m | = 3 . Then, γ ( Γ ( R ) ) 3 .
Proof. 
Assume to the contrary that γ ( Γ ( R ) ) = 3 . Then, by Theorem 4, | R | = 81 and m 4 = 0 . Note that R is isomorphic to one of the following 22 commutative local rings [18].
F 81 , Z 81 , F 9 [ x ] / ( x 2 ) , Z 3 [ x ] / ( x 4 ) , Z 3 [ x , y ] / ( x 2 y 2 , x y ) , Z 3 [ x , y ] / ( x 2 2 y 2 , x y ) , Z 3 [ x , y ] / ( x 3 , x y , y 2 ) , Z 3 [ x , y , z ] / ( x , y , z ) 2 , Z 9 [ x ] / ( x 2 ) , Z 9 [ x ] / ( x 2 3 ) , Z 9 [ x ] / ( x 2 6 ) , Z 9 [ x ] / ( 3 x , x 3 ) , Z 9 [ x ] / ( x 2 2 ) , Z 9 [ x ] / ( 3 x , x 3 3 ) , Z 9 [ x , y ] / ( x 2 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 6 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 3 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 6 , x y , 3 x , 3 y ) , Z 27 [ x ] / ( 3 x , x 2 ) , Z 27 [ x ] / ( 3 x , x 2 9 ) , Z 27 [ x ] / ( 3 x , x 2 18 ) .
(1) If R F 81 , then the zero-divisor graph Γ ( R ) is empty, a contradiction.
(2) Let R be isomorphic to any one of the following seven rings:
Z 81 , F 9 [ x ] / ( x 2 ) , Z 3 [ x ] / ( x 4 ) , Z 9 [ x ] / ( x 2 3 ) , Z 3 [ x ] / ( x 2 6 ) , Z 9 [ x ] / ( 3 x , x 3 3 ) , Z 9 [ x ] / ( x 2 2 ) .
Then, by Theorem 3, γ ( Γ ( R ) ) = 2 , a contradiction.
(3) If R Z 9 [ x ] / ( x 2 ) , then every vertex of the set V 1 = { x + 3 , 4 x + 3 , 7 x + 3 , 2 x + 6 , 5 x + 6 , 8 x + 6 } is adjacent to all the vertices of the set V 2 = { 2 x + 3 , 5 x + 3 , 8 x + 3 , x + 6 , 4 x + 6 , 7 x + 6 } . Therefore, Γ ( R ) contains K 6 , 6 as a subgraph and so, by Proposition 2, γ ( Γ ( R ) ) 4 .
(4) If R Z 3 [ x , y , z ] / ( x , y , z ) 2 , then the subgraph induced by the set { x , y , z , 2 x , 2 y , 2 z , x + y , x + z , y + z , x + 2 y , 2 x + 2 y , 2 x + y , 2 y + z , y + 2 z , 2 y + 2 z , 2 x + z , x + 2 z , 2 x + 2 z , x + y + z , 2 x + y + z , x + 2 y + z , x + y + 2 z , 2 x + 2 y + z , 2 x + y + 2 z , x + 2 y + 2 z , 2 x + 2 y + 2 z } forms K 26 in Γ ( R ) and so, by Proposition 1, γ ( Γ ( R ) ) 42 .
(5) If R Z 3 [ x , y , z ] / ( x 3 , x y , y 2 ) 2 , then the partite sets V 1 = { x 2 , y , 2 x 2 , 2 y , x 2 + y , 2 x 2 + y , x 2 + 2 y , 2 x 2 + 2 y } and V 2 = { x , 2 x , x 2 + x , x + y , 2 x 2 + x , x 2 + 2 x , 2 x 2 + 2 x } form K 8 , 7 in Γ ( R ) , which implies that γ ( Γ ( R ) ) 4 .
(6) If R Z 9 [ x ] / ( 3 x , x 3 ) , then the partite sets V 1 = { 3 , 6 , x 2 , 2 x 2 } and V 2 = { x , 2 x , x 2 + x , x 2 + 2 x , 2 x 2 + x , 2 x 2 + 2 x , x + 3 , 2 x + 3 , x 2 + 3 , x 2 + x + 3 , x 2 + 2 x + 3 , 2 x 2 + 3 , 2 x 2 + x + 3 , 2 x 2 + 2 x + 3 , x + 6 , 2 x + 6 , x 2 + 6 , x 2 + x + 6 , x 2 + 2 x + 6 , 2 x 2 + 6 , 2 x 2 + x + 6 , 2 x 2 + 2 x + 6 } form K 4 , 22 as a subgraph in Γ ( R ) . Therefore, γ ( Γ ( R ) ) 10 .
(7) Let R be isomorphic to any one of the following five rings:
Z 9 [ x , y ] / ( x 2 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 6 , y 2 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 3 , x y , 3 x , 3 y ) , Z 9 [ x , y ] / ( x 2 3 , y 2 6 , x y , 3 x , 3 y ) .
Then, the partite sets V 1 = { x , 2 x , x + 3 , x + 6 , 2 x + 3 , 2 x + 6 } and V 2 = { y , 2 y , y + 3 , y + 6 , 2 y + 3 , 2 y + 6 } form a subgraph K 6 , 6 in Γ ( R ) . Hence, γ ( Γ ( R ) ) 4 .
(8) Let R Z 27 [ x ] / ( 3 x , x 2 ) or Z 27 [ x ] / ( 3 x , x 2 9 ) or Z 27 [ x ] / ( 3 x , x 2 18 ) . Then, Γ ( R ) contains a subgraph K 6 , 8 , where the partite sets are V 1 = { 3 , 6 , 12 , 15 , 21 , 24 } and V 2 = { 9 , 18 , x , 2 x , x + 9 , x + 18 , 2 x + 9 , 2 x + 18 } . Thus, γ ( Γ ( R ) ) 6 .
(9) Let R Z 3 [ x , y ] / ( x 2 y 2 , x y ) or Z 3 [ x , y ] / ( x 2 2 y 2 , x y ) . Then, Γ ( R ) contains K 5 , 7 as a subgraph with the bipartite sets V 1 = { y , 2 y , x 2 + y , 2 x 2 + y , 2 x 2 + 2 y } and V 2 = { x , x 2 , 2 x , 2 x 2 , x 2 + x , 2 x 2 + x , 2 x 2 + 2 x } . Thus, γ ( Γ ( R ) ) 4 .
Hence, γ ( Γ ( R ) ) 3 for all the 22 local rings of order 81 with m 4 = 0 , which is in contradiction to our assumption. □
Theorem 5.
Let ( R , m ) be a local ring. Then, the genus of the zero-divisor graph of R is 3 if and only if one of the following conditions hold:
(i)
The residue field | R / m | = 4 with | R | = 64 , | m 2 | = 4 and m 3 = 0 .
(ii)
The residue field | R / m | = 2 with | R | = 64 , | m 2 | = 16 , | m 3 | = 8 , | m 4 | = 4 , | m 5 | = 2 and m 6 = 0 .
(iii)
Any one of the local rings of order 32.
Z 2 [ x , y ] / ( x 4 , x y , y 2 ) , Z 2 [ x , y ] / ( x 3 , x 2 y , y 2 ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x y ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x 2 x y ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 + 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x ] / ( x 4 , 2 x ) , Z 4 [ x ] / ( x 3 , 2 x 2 ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , y 2 , x y + 2 , 2 x , 2 y ) , Z 8 [ x ] / ( 4 x , x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x ) , Z 8 [ x ] / ( 4 x , x 2 2 x 4 ) , Z 16 [ x ] / ( 2 x , x 2 ) , Z 4 [ x , y ] / ( x y 2 , x 2 , y 2 + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 2 , y 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 2 2 , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 2 x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y , z ] / ( x 2 z , y 2 , z 2 , x y , y z , x z 2 , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 z , y 2 2 , z 2 , x y , y z , x z 2 , 2 x , 2 y , 2 z ) .
Proof. 
Let ( R , m ) be a local ring. Suppose γ ( Γ ( R ) ) = 3 . Then, by Theorem 4, the number of elements in the residue field R / m is 2 or 3 or 4.
If | R / m | = 4 , then, by Lemma 3, we have | R | = 64 and also m has a nilpotency index of 3. This implies that | m | = 16 , | m 2 | = 4 and m 3 = 0 .
If | R / m | = 3 , then, by Lemma 4, we obtain γ ( Γ ( R ) ) 3 , a contradiction.
Let | R / m | = 2 . By Theorem 4, we have | R | = 64 or 32 with m 6 = 0 .
Case 1: Suppose | R | = 64 with m 6 = 0 . Then, | m | = 32 .
We claim that the nilpotency index of m is 6. In order to prove this claim, assume to the contrary that m = 0 for some 5 .
Case 1.1: If m 2 = 0 , then the 31 non-zero elements in m together form a complete graph in Γ ( R ) . So, by Proposition 1, we have γ ( Γ ( R ) ) 63 , a contradiction.
Case 1.2: Suppose m 3 = 0 . If | m 2 | = k 4 , then Γ ( R ) contains K k 1 , 32 k as a subgraph and so, by Proposition 2, γ ( Γ ( R ) ) 7 . Therefore, | m 2 | = 2 . This implies that d i m R / m m / m 2 = 4 . So we assume m = ( x , y 1 , y 2 , y 3 ) for some x , y i m m 2 . Without loss of generality, we may assume that m 2 = ( x 2 ) or m 2 = ( x y 1 ) .
Case 1.2.1: Assume that m 2 = ( x 2 ) . Then, by Proposition 7, we have x y i = 0 .
(i). If y i y j = 0 for all 1 i j 3 , then K 5 , 7 Γ ( R ) , where the bipartite sets are { x , x 2 , x + x 2 , y 3 , y 3 + x 2 } and { y 1 , y 1 + x 2 , y 2 , y 2 + x 2 , y 1 + y 2 , y 1 + y 2 + x 2 , y 1 + y 3 } . Therefore, γ ( Γ ( R ) ) 4 .
(ii). Suppose exactly one element of { y 1 y 2 , y 1 y 3 , y 2 y 3 } is non-zero, say y 1 y 2 0 . That is, y 1 y 3 = y 2 y 3 = 0 . Let u 1 = x , u 2 = x 2 , u 3 = x + x 2 , u 4 = y 3 , u 5 = y 3 + x 2 , v 1 = y 1 , v 2 = y 1 + x 2 , v 3 = y 2 , v 4 = y 2 + x 2 , v 5 = y 1 + y 2 , v 6 = y 1 + y 2 + x 2 and v 7 = y 1 + y 3 . Clearly, u i v j = 0 for all i = 1 , 2 , , 5 and j = 1 , 2 , , 7 and so K 5 , 7 Γ ( R ) . Thus γ ( Γ ( R ) ) 4 .
(iii). Suppose exactly two elements of { y 1 y 2 , y 1 y 3 , y 2 y 3 } are non-zero. If y 1 y 2 0 and y 1 y 3 0 , then y 1 y 2 = x 2 = y 1 y 3 . This implies that y 1 ( y 3 y 2 ) = 0 . Let us take y 3 = ( y 3 y 2 ) . Clearly, x y 3 = y 1 y 3 = 0 and so ( x y 1 ) y 3 = 0 . Therefore, ( x , y 1 , y 2 , y 3 ) = ( x , y 1 , y 2 , y 3 ) . Similarly, if y 1 y 2 0 and y 2 y 3 0 , then y 1 y 2 = x 2 = y 2 y 3 , so that y 2 ( y 3 y 1 ) = 0 . Let y 3 = ( y 3 y 1 ) , and we have ( x , y 1 , y 2 , y 3 ) = ( x , y 1 , y 2 , y 3 ) and x y 3 = y 2 y 3 = 0 . So γ ( Γ ( R ) ) 4 .
Case 1.2.2: Assume that m 2 = ( x y 1 ) . Then, none of x 2 , y 1 2 , y 2 2 and y 3 2 are in m 2 m 3 . Thus, x 2 = y 1 2 = y 2 2 = y 3 2 = 0 . By Proposition 8, we obtain x · y 2 = 0 = x · y 3 . If necessary, replacing y 2 by y 2 x and y 3 by y 3 x , we have y 1 · y 2 = 0 = y 1 · y 3 . Now, let u 1 = x , u 2 = x + x y 1 , u 3 = y 1 , u 4 = y 1 + x y 1 , u 5 = x + y 1 , u 6 = x + y 1 + x y 1 , v 1 = y 2 , v 2 = y 2 + x y 1 , v 3 = y 3 , v 4 = y 3 + x y 1 , v 5 = y 2 + y 3 and v 6 = y 2 + y 3 + x y 1 . Then, u i · v j = 0 for every i , j , so that K 6 , 6 Γ ( R ) . Therefore, γ ( Γ ( R ) ) 4 .
Case 1.3: Suppose m 4 = 0 . Then, | m 3 |   2 and | m 2 |   4 . If | m 3 |   4 , then Γ ( R ) contains K 3 , 28 as a subgraph and so γ ( Γ ( R ) ) 7 . Therefore, | m 3 | = 2 and | m 2 | = 4 . Consequently, d i m R / m m / m 2 = 3 . So, let m = ( x , y 1 , y 2 ) for some x , y i m m 2 , and without loss of generality, assume m 2 = ( x 2 ) or m 2 = ( x y 1 ) .
First, assume that m 2 = ( x 2 ) . Then, x · y 1 = 0 = x · y 2 . Since | m 2 |   = 4 , we let a , b m 2 { 0 } . This implies that a · b = 0 . Let u 1 = x , u 2 = x 2 , u 3 = a , u 4 = b , u 5 = x + x 2 , u 6 = x + a , u 7 = x + b , v 1 = y 1 , v 2 = y 2 , v 3 = y 1 + x 2 , v 4 = y 1 + a , v 5 = y 1 + b , v 6 = y 2 + x 2 , v 7 = y 2 + a and v 8 = y 2 + b . Since u i · v j = 0 for every i , j , we have K 7 , 8 Γ ( R ) so that γ ( Γ ( R ) ) 8 .
Second, assume that m 2 = ( x y 1 ) . Then, by Lemma 8, we have x y 2 = 0 . Moreover, we may assume that each of x 2 , y 1 2 , and y 2 2 are in m 3 . However, m 3 = m · m 2 = ( x 2 y 1 , x y 1 2 ) m 4 = 0 , a contradiction.
Case 1.4: Suppose m 5 = 0 . Then, | m 4 |   2 , | m 3 |   4 and | m 2 |   8 . If | m 3 |   = 8 , then | m 2 |   = 16 . Since m 2 · m 3 = 0 , we have Γ ( R ) contains K 7 , 8 as a subgraph and so γ ( Γ ( R ) ) 7 , a contradiction. Therefore, | m 3 |   = 4 . Consequently, | m 4 |   = 2 . Thus, just two cases can occur: either | m 2 |   = 8 or | m 2 |   = 16 .
First, suppose that | m 2 | = 8 . Then, d i m R / m m / m 2 = 2 , and we have m = ( x , y ) for some x , y m m 2 . Without loss of generality, m 2 = ( x 2 ) or m 2 = ( x y ) . Let m 2 = ( x 2 ) . Then, x · y = 0 and so m 3 = ( x 3 ) . Clearly, y + ( x 2 ) ( x 2 ) and y + ( x 3 ) ( x 2 ) are mutually disjoint sets. Note that, in Γ ( R ) , every elements in the set { x 3 } y + m 3 is adjacent to all the elements of m 2 { 0 } so that K 5 , 7 Γ ( R ) . Therefore, γ ( Γ ( R ) ) 4 . Let m 2 = ( x y ) . Since the cosets ( x y ) , x + m 2 and y + m 2 are mutually disjoint and since m 3 m 2 , we have the sets x + m 2 , y + m 2 and m 3 which are mutually disjoint. Then, in Γ ( R ) , every element in X = x + m 2 y + m 2 is adjacent to every element of Y = m 3 { 0 } so that K 3 , 16 Γ ( R ) . Therefore, γ ( Γ ( R ) ) 4 .
Second, suppose that | m 2 | = 16 . Then, d i m R / m m / m 2 = 1 and so m is principal. Therefore, m i is principal for every i. This implies that d i m R / m m i / m i + 1 = 1 for all i = 1 , 2 , 3 , which contradicts the fact that d i m R / m m 2 / m 3 = 2 .
Case 1.5: Suppose m 6 = 0 . Then, | m 5 |   = 2 , | m 4 |   = 4 , | m 3 |   = 8 , | m 2 |   = 16 . Consequently, d i m R / m m i / m i + 1 = 1 for all i = 1 , , 4 and m i ’s are the principal ideal for all i = 1 , , 5 . Note that, in Γ ( R ) , the subgraph induced by m 3 is complete, every element in m 2 m 3 is adjacent to all the vertices of m 4 and every element in m m 2 is adjacent to the single non-zero element of m 5 . By labeling the vertices of Γ ( R ) by m 4 { 0 } = { a , b , c } , m 3 m 4 = { 1 , 2 , 3 , 4 } and m 2 m 3 = { 5 , 6 , , 12 } , it follows that Γ ( R ) ˜ is isomorphic to the graph given in Figure 1. Thus, by Lemma 2, we obtain γ ( Γ ( R ) ) = 3 .
Hence, in Case 1, γ ( Γ ( R ) ) = 3 if and only if | R | = 64 such that m 6 = 0 , | m 5 |   = 2 , | m 4 |   = 4 , | m 3 |   = 8 and | m 2 |   = 16 .
Case 2: Suppose | R | = 32 with m 6 = 0 . This implies that | m | = 16 . Then, by Lemma 1, there exist 53 (non-field) local rings.
(1). Assume that R is isomorphic to any one of the following eight rings:
Z 32 , Z 2 [ x ] / ( x 5 ) , Z 4 [ x ] / ( 2 x , x 4 2 ) , Z 4 [ x ] / ( 2 x 2 , x 3 2 ) , Z 4 [ x ] / ( x 3 2 x , 2 x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x + 2 ) .
Then, by Theorem 2, we have Γ ( R ) as toroidal.
(2). Assume that R is isomorphic to one of the following five rings:
Z 2 [ x , y ] / ( x 4 , x y , y 2 x 3 ) , Z 4 [ x , y ] / ( x 2 2 , y 2 2 x , x y , 2 y ) , Z 4 [ x , y ] / ( x 3 2 , y 2 2 , x y , 2 x ) , Z 8 [ x ] / ( 2 x , x 3 4 ) , Z 16 [ x ] / ( 2 x , x 2 8 ) .
Then, by Theorem 3, we have that Γ ( R ) is double toroidal.
(3). Assume that R is isomorphic to one of the following 19 rings:
Z 2 [ x , y ] / ( x 4 , x y , y 2 ) , Z 2 [ x , y ] / ( x 3 , x 2 y , y 2 ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x y ) , Z 2 [ x , y ] / ( x 3 , y 3 , y 2 x 2 x y ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 + 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x ] / ( x 4 , 2 x ) , Z 4 [ x ] / ( x 3 , 2 x 2 ) , Z 4 [ x , y ] / ( x 3 , x 2 + y 2 , x y + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , y 2 , x y + 2 , 2 x , 2 y ) , Z 8 [ x ] / ( 4 x , x 2 ) , Z 8 [ x ] / ( 4 x , x 2 2 x ) , Z 8 [ x ] / ( 4 x , x 2 2 x 4 ) , Z 16 [ x ] / ( 2 x , x 2 ) , Z 4 [ x , y ] / ( x y 2 , x 2 , y 2 + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 2 , y 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 2 2 , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 2 x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y , z ] / ( x 2 z , y 2 , z 2 , x y , y z , x z 2 , 2 x , 2 y , 2 z ) , Z 4 [ x , y , z ] / ( x 2 z , y 2 2 , z 2 , x y , y z , x z 2 , 2 x , 2 y , 2 z ) .
Then, the corresponding zero-divisor graphs of R are provided in a tabular format.
Thus, all the zero-divisor graphs displayed in Table 1 are either the graph H (refer Figure 1) or a subgraph of H. Hence, by Lemma 2, in this case, γ ( Γ ( R ) ) = 3 for all the 17 local rings.
(4). Let R Z 2 [ x , y , z , t ] / ( x , y , z , t ) 2 and S = Z 4 [ x , y , z ] / ( 2 , x , y , z ) 2 . Then, V ( Γ ( R ) ) = { x , y , z , t , x + y , x + z , x + t , x + y + z , x + y + t , x + y + z + t , y + z , y + t , y + z + t , z + t , x + z + t } and V ( Γ ( S ) ) = { x , y , z , 2 , x + 2 , y + 2 , z + 2 , x + y , x + z , y + z , x + y + z , x + y + 2 , x + z + 2 , y + z + 2 , x = y + z + 2 } . It is clear that Γ ( R ) and Γ ( S ) are isomorphic to K 15 and so γ ( Γ ( R ) ) 11 .
(5). Assume that R is isomorphic to one of the following three rings:
Z 2 [ x , y , z ] / ( x 3 , y 2 , z 2 , x y , x z , y z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 , z 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , Z 8 [ x , y ] / ( x 2 , y 2 , x y , 2 x , 2 y ) .
If R Z 2 [ x , y , z ] / ( x 3 , y 2 , z 2 , x y , x z , y z ) , then the partite sets { x 2 , y , z , x 2 + y , x 2 + z , x 2 + y + z , y + z } and { x , x 2 + x , x 2 + x + y , x 2 + x + z , x + y , x + z , x + y + z , x 2 + x + y + z } forms K 7 , 8 in Γ ( R ) . Therefore, γ ( Γ ( R ) ) 8 .
If R Z 4 [ x , y ] / ( x 3 , y 2 , x y , 2 x , 2 y ) , then the partite sets { 2 , 2 + y , x 2 , y , x 2 + y , x 2 + 2 , x 2 + y + 2 } and { x , x + 2 , x + y , x 2 + x + y , x + y + 2 , x 2 + x + y + 2 , x 2 + x , x 2 + x + 2 } forms K 7 , 8 in Γ ( R ) . Therefore, γ ( Γ ( R ) ) 8 .
If R Z 4 [ x , y , z ] / ( x 2 2 , y 2 , z 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , then every vertex in the set { 2 , y , z , y + 2 , z + 2 , y + z , y + z + 2 } is adjacent to all the vertices of { x , x + 2 , x + y , x + z , x + y + 2 , x + z + 2 , x + y + z , x + y + z + 2 } in Γ ( R ) . So K 7 , 8 Γ ( R ) , a contradiction.
If R Z 8 [ x , y ] / ( x 2 , y 2 , x y , 2 x , 2 y ) , then Γ ( R ) contains K 7 , 8 , as a subgraph with bipartite sets { 4 , x , y , 4 + x , 4 + y , x + y , x + y + 4 } and { 2 , 6 , 2 + x , 2 + y , 6 + x , 6 + y , x + y + 2 , x + y + 6 } , a contradiction.
(6). Assume that R is isomorphic to one of the following three rings:
Z 2 [ x , y , z ] / ( y 2 x 2 , z 2 , x y , x z , y z ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 , x y , x z , y z , 2 x , 2 y , 2 z ) , Z 8 [ x , y ] / ( x 2 4 , y 2 , x y , 2 x , 2 y ) .
Note that the number of vertices and number of edges in Γ ( R ) is n = 15 and m = 62 , respectively. If γ ( Γ ( R ) ) = 3 , then, by Proposition 3, there are 43 faces in any S 3 -embedding of Γ ( R ) . So the average length of the faces is 2 m f = 2.88 , which is less than the girth value(=3) of Γ ( R ) , a contradiction.
(7). Assume that R is isomorphic to one of the following five rings:
Z 4 [ x , y ] / ( x 3 , x 2 + x y , y 2 + 2 , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 3 , y 2 + 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 2 y 2 , x y , 2 x , 2 y ) , Z 4 [ x , y , z ] / ( x 2 2 x , y 2 , x y , 2 y ) , Z 8 [ x ] / ( 2 x , x 3 )
Let R Z 4 [ x , y ] / ( x 3 , x 2 + x y , y 2 + 2 , 2 x , 2 y ) . Then, in Γ ( R ) , every vertex of the set V 1 = { 2 , x y , 2 + x y } is adjacent to all the vertices of V 2 = { x , y , x + 2 , y + 2 , x + y + 2 , x + x y , y + x y , x + y + x y , x + x y + 2 , y + x y + 2 , x + y + x y + 2 } . Therefore, K 3 , 12 is a subgraph of Γ ( R ) . Clearly, γ ( K 3 , 12 ) = 3 . By Euler’s formula, there are 17 faces when drawing K 3 , 12 on S 3 . Fix a representation of S 3 -embedding of K 3 , 12 and denote it as L. Let f i be the number of i-gons of K 3 , 12 corresponding to the representation L. Since | V 1 | = 3 , we have i 6 . Therefore, f 4 + f 6 = 17 and 4 f 4 + 6 f 6 = 2 e = 2 × 36 . This implies that there are fifteen rectangular and two hexagonal faces in L. Note that, in Γ ( R ) , each vertex in A = { x + y + 2 , x + y + x y , x + y + x y + 2 } V 2 is adjacent to all the four vertices in B = { x , x + 2 , x + x y , x + x y + 2 } V 2 . If γ ( Γ ( R ) ) = 3 , then we have to embed all these 12 edges into L. Choose an arbitrary v A . Then, d e g K 3 , 12 ( v ) = 3 and so v is a part of exactly three faces of L. Notice that any rectangular face can adopt at most one new edge into it and any hexagonal face can adopt at most three edges between the vertices of V 2 . So to embed the four edges between v and a vertex of B, two rectangular and one hexagonal face are required. Therefore, to embed all the edges between A and B, six rectangular and three hexagonal faces are required, a contradiction to L which has two hexagonal faces.
If S Z 4 [ x , y ] / ( x 3 , y 2 + 2 , x y , 2 x , 2 y ) , Z 4 [ x , y ] / ( x 2 y 2 , x y , 2 x , 2 y ) , Z 4 [ x , y , z ] / ( x 2 2 x , y 2 , x y , 2 y ) or Z 8 [ x ] / ( 2 x , x 3 ) , then it is not hard to verify that the graph Γ ( Z 4 [ x , y ] / ( x 3 , x 2 + x y , y 2 + 2 , 2 x , 2 y ) ) is isomorphic to a subgraph of Γ ( S ) so that γ ( Γ ( S ) ) 4 .
(8). Assume that R is isomorphic to one of the following five rings:
Z 2 [ x , y , z ] / ( y 2 x 2 , z 2 x 2 , x y , x z , y z ) , Z 4 [ x , y ] / ( x 2 , y 2 2 x , x y , 2 y ) , Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 2 , x y , y z , x z , 2 x , 2 y , 2 z ) , Z 8 [ x , y ] / ( x 2 4 , y 2 4 , x y , 2 x , 2 y ) , Z 8 [ x , y ] / ( x 2 , y 2 , x y 4 , 2 x , 2 y ) .
Let R Z 2 [ x , y , z ] / ( y 2 x 2 , z 2 x 2 , x y , x z , y z ) . Then, consider the subgraph H 1 = Γ ( R ) { ( x 2 , x + y + z ) , ( x 2 , x 2 + x + y + z ) , ( x 2 , z ) , ( x 2 , x ) , ( x 2 , y ) , ( x 2 , x 2 + z ) , ( x 2 , x 2 + x ) , ( x 2 , x 2 + y ) , ( z , y ) , ( z , x 2 + y ) , ( x 2 + z , y ) , ( x 2 + z , x 2 + y ) , ( x + y , x 2 + x + y ) , ( x 2 + y + z , y + z ) , ( x + z , x 2 + x + z ) } . The diagrammatic representation of H 1 is given in Figure 3. Note that H 1 is a triangle-free graph and the number vertices and edges of H 1 is n = 15 and m = 38 , respectively. Therefore, by Remark 2, we obtain γ ( H 1 ) 3 . Suppose that γ ( Γ ( R ) ) = 3 . Then, γ ( H 1 ) = 3 and also, by Euler’s formula, there are 19 faces in any S 3 -embedding of H 1 . Let f i be the number of i-gons in a S 3 -embedding of H 1 . Then, f 4 + f 5 + = 19 and 4 f 4 + 5 f 5 + = 2 × 38 . This implies that all the faces in any S 3 -embedding of H 1 are rectangular. Now, to recover a S 3 -embedding of Γ ( R ) from a S 3 -embedding of H 1 , we have to embed all the 15 omitted edges of Γ ( R ) into a S 3 -embedding of H 1 . Notice that each rectangular face can adapt at most one edge into it. So to embed the eight edges incident with the vertex x 2 , namely ( x 2 , x + y + z ) , ( x 2 , x 2 + x + y + z ) , ( x 2 , z ) , ( x 2 , x ) , ( x 2 , y ) , ( x 2 , x 2 + z ) , ( x 2 , x 2 + x ) and ( x 2 , x 2 + y ) , eight rectangular faces which contain x 2 are required. But d e g H 1 ( x 2 ) = 6 . This implies that x 2 is a part of exactly six rectangular faces of any S 3 -embedding of H 1 , a contradiction. Therefore, γ ( Γ ( R ) ) 4 .
If S Z 4 [ x , y ] / ( x 2 , y 2 2 x , x y , 2 y ) or Z 4 [ x , y , z ] / ( x 2 2 , y 2 2 , z 2 2 , x y , y z , x z , 2 x , 2 y , 2 z ) , or Z 8 [ x , y ] / ( x 2 4 , y 2 4 , x y , 2 x , 2 y ) or Z 8 [ x , y ] / ( x 2 , y 2 , x y 4 , 2 x , 2 y ) , then Γ ( S ) Γ ( R ) and so γ ( Γ ( S ) ) 4 .
(9). Assume that R is isomorphic to one of the following four rings:
Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , x z , y z 2 , 2 x , 2 y , 2 z ) , Z 4 [ x , y ] / ( x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y ] / ( x 2 , y 2 , 2 x , 2 y ) , Z 2 [ x , y , z ] / ( x 3 , y 2 , z 2 , x y , y z ) .
Let R Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , x z , y z 2 , 2 x , 2 y , 2 z ) . Take u 1 = 2 , u 2 = x , u 3 = 2 + x and v 1 = y , v 2 = x + y , v 3 = x + y + 2 , v 4 = y + 2 , v 5 = z , v 6 = x + z , v 7 = z + 2 , v 8 = x + z + 2 , v 9 = y + z , v 10 = y + z + 2 , v 11 = x + y + z , v 12 = x + y + z + 2 . Then, Γ ( R ) is isomorphic to Figure 4 and γ ( Γ ( R ) 3 , since a copy of K 3 , 12 is contained in Γ ( R ) . Suppose that γ ( Γ ( R ) = 3 . Consider the subgraph H 2 = Γ ( R ) { ( v 1 , v 2 ) , ( v 1 , v 3 ) , ( v 1 , v 4 ) , ( v 2 , v 3 ) , ( v 2 , v 4 ) , ( v 3 , v 4 ) , ( v 5 , v 6 ) , ( v 5 , v 7 ) , ( v 5 , v 8 ) , ( v 6 , v 7 ) , ( v 6 , v 8 ) , ( v 7 , v 8 ) , ( v 9 , v 10 ) , ( v 9 , v 11 ) , ( v 9 , v 12 ) , ( v 10 , v 11 ) , ( v 10 , v 12 ) , ( v 11 , v 12 ) , ( u 1 , u 2 ) , ( u 1 , u 3 ) , ( u 2 , u 3 ) } . Then, H 2 is isomorphic to K 3 , 12 and clearly γ ( H 2 ) = 3 .
By the Euler formula, the faces of any S 3 -embedding of H 2 have fifteen rectangular and two hexagonal faces. Now, we try to embed the 21 omitted edges of Γ ( R ) into an arbitrary S 3 -embedding of H 2 .
First, we try to insert the edges ( v 1 , v 2 ) , ( v 1 , v 3 ) , ( v 1 , v 4 ) , ( v 2 , v 3 ) , ( v 2 , v 4 ) , ( v 3 , v 4 ) into a S 3 -embedding of H 2 . To embed edges, we require one hexagonal and three rectangular faces, which we name as F 1 , F 2 , F 3 , F 4 (see Figure 5a). Similarly, to embed the next six edges ( v 5 , v 6 ) , ( v 5 , v 7 ) , ( v 5 , v 8 ) , ( v 6 , v 7 ) , ( v 6 , v 8 ) , ( v 7 , v 8 ) , we require another one hexagonal and three rectangular faces, which we name as F 5 , F 6 , F 7 , F 8 . Here, we notice that the vertices v i , v j , for i = 1 , 2 , 3 and j = 5 , 6 , 7 are placed in two faces of F 1 , F 2 , , F 8 . Since d e g K 3 , 12 ( v i ) = d e g K 3 , 12 ( v j ) = 3 , one more face should have v i , v j ’s and those which form three rectangular faces, we name as F 9 , F 10 and F 11 . The edges ( u 1 , u 2 ) , ( u 1 , u 3 ) and ( u 2 , u 3 ) can be embedded in the F 9 , F 10 , F 11 , respectively.
Next, to embed the three edges ( v 9 , v 10 ) , ( v 9 , v 11 ) , ( v 9 , v 12 ) , we requires three rectangular faces, which we name as F 12 , F 13 and F 14 , all of which contain v 9 (Figure 5b). Furthermore, to embed two edges ( v 10 , v 11 ) , ( v 10 , v 12 ) , two rectangular faces are required, which we name as F 15 , F 16 , all of which contain v 10 (Figure 5b). Since d e g K 3 , 12 ( v 11 ) = d e g K 3 , 12 ( v 12 ) = 3 and 17 faces are in S 3 -embedding of H 2 , exactly one more face should have v 11 , v 12 , and we shall denote it as F 17 . Notice that, in any S 3 -embedding, every edge of a graph is in exactly two faces. Here, the edges ( v 11 , u 1 ) and ( v 12 , u 2 ) are used twice in the faces F 12 , F 13 , F 15 , F 16 . Now, the choices for another one diagonal of F 17 are in { u 1 , u 2 , u 3 } . Obviously, we have to select distinct vertices for F 17 in which one is from { u 1 , u 2 } , { u 1 , u 3 } or { u 2 , u 3 } . This is a contradiction to the fact that the edges ( v 11 , u 1 ) and ( v 12 , u 2 ) are used twice in the faces F 12 , F 13 , F 15 , F 16 . Therefore, γ ( Γ ( R ) ) 4 .
Furthermore, if S Z 4 [ x , y ] / ( x 2 , y 2 , x y , 2 y ) , Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y 2 , x z , y z , 2 x , 2 y , 2 z ) or Z 2 [ x , y , z ] / ( x 3 , y 2 , z 2 , x y , y z ) , then Γ ( R ) Γ ( S ) and so γ ( Γ ( S ) ) 4 . □

4. Conclusions

Over the last twenty years, a number of research studies have identified all commutative rings with zero-divisor graphs with genus equal to or less than 2. This work lists all isomorphism classes of local commutative rings with identities whose zero-divisor graphs have genus three. Which non-local commutative rings have genus three zero-divisor graphs is, at this time, an open question.

Author Contributions

Conceptualization, T.A. (Thangaraj Asir); methodology, T.A. (Thangaraj Asir) and K.M.; investigation, K.M.; writing original draft preparation, T.A. (Thangaraj Asir) and K.M.; writing review and editing, T.A. (Thangaraj Asir) and T.A. (Turki Alsuraiheed); supervision, T.A. (Thangaraj Asir); project administration, T.A. (Turki Alsuraiheed); funding acquisition, T.A. (Turki Alsuraiheed). All authors have read and agreed to the published version of the manuscript.

Funding

This research project was funded by Researchers Supporting Project at King Saud University, under grant no. RSPD2023R934. The first and third authors, therefore, acknowledge with thanks King Saud University for financial support.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data sharing not applicable to this work as no datasets were generated or analysed during the current study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
  2. Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
  3. Anderson, D.F.; Asir, T.; Badawi, A.; Chelvam, T.T. Graphs from Rings; Springer: Berlin/Heidelberg, Germany, 2021. [Google Scholar]
  4. Anderson, D.F.; Frazier, A.; Lauve, A.; Livingston, P.S. The zero-divisor graph of a commutative ring—II. Lect. Notes Pure Appl. Math. 2001, 220, 61–72. [Google Scholar]
  5. Smith, N.O. Planar zero-divisor graphs. Int. J. Commut. Rings 2003, 2, 177–188. [Google Scholar]
  6. Smith, N.O. Infinite planar zero-divisor graphs. Comm. Algebra 2007, 35, 171–180. [Google Scholar] [CrossRef]
  7. Belshoff, R.; Chapman, J. Planar zero-divisor graphs. J. Algebra 2007, 316, 471–480. [Google Scholar] [CrossRef]
  8. Chiang-Hsieh, H.-J.; Smith, N.O.; Wang, H.-J. Commutative rings with toroidal zero-divisor graphs. Houston J. Math. 2010, 36, 1–31. [Google Scholar]
  9. Bloomfield, N.; Wickham, C. Local rings with genus two zero-divisor graph. Comm. Algebra 2010, 38, 2965–2980. [Google Scholar] [CrossRef]
  10. Asir, T.; Mano, K. Classification of non-local rings with genus two zero-divisor graphs. Soft Comput. 2020, 24, 237–245. [Google Scholar] [CrossRef]
  11. Chiang-Hsieh, H.-J. Classification of rings with projective zero-divisor graphs. J. Algebra 2008, 319, 2789–2802. [Google Scholar] [CrossRef]
  12. Asir, T.; Mano, K. Classification of rings with crosscap two class of graphs. Discrete Appl. Math. 2019, 265, 13–21. [Google Scholar] [CrossRef]
  13. Wickham, C. Classification of rings with genus one zero-divisor graphs. Comm. Algebra 2008, 36, 325–345. [Google Scholar] [CrossRef]
  14. White, A.T. Graphs, Groups and Surfaces; North-Holland: Amsterdam, The Netherlands, 1973. [Google Scholar]
  15. Chen, J. Minimum and maximum imbeddings. In Handbook of Graph Theory; Gross, J.L., Yellen, J., Eds.; CRC Press: Boca Raton, FL, USA, 2004; Chapter 7.2. [Google Scholar]
  16. Ringeisen, R.D. Determining all compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings. J. Comb. Theory B 1972, 12, 101–104. [Google Scholar] [CrossRef]
  17. Atiyah, M.; MacDonald, I. Introduction to Commutative Algebra; Addison-Wesley Publishing Co.: Boston, MA, USA, 1969. [Google Scholar]
  18. Nowicki. Tables of Finite Commutative Local Rings of Small Orders. 2018. Available online: https://api.semanticscholar.org/CorpusID:201747066 (accessed on 18 January 2023).
Figure 1. Graph H.
Figure 1. Graph H.
Symmetry 15 02167 g001
Figure 2. The graph H can be embedded in the surface S 3 .
Figure 2. The graph H can be embedded in the surface S 3 .
Symmetry 15 02167 g002
Figure 3. The triangle-free subgraph H 1 of Γ ( R ) .
Figure 3. The triangle-free subgraph H 1 of Γ ( R ) .
Symmetry 15 02167 g003
Figure 4. Γ ( Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , x z , y z 2 , 2 x , 2 y , 2 z ) ) .
Figure 4. Γ ( Z 4 [ x , y , z ] / ( x 2 , y 2 , z 2 , x y , x z , y z 2 , 2 x , 2 y , 2 z ) ) .
Symmetry 15 02167 g004
Figure 5. Face distribution of S 3 -embedding of H 2 .
Figure 5. Face distribution of S 3 -embedding of H 2 .
Symmetry 15 02167 g005
Table 1. Zero-divisor graphs of certain rings.
Table 1. Zero-divisor graphs of certain rings.
RingVertex PartitionGraph
R V ( Γ ( R ) ) = V 1 V 2 Γ ( R )
Z 2 [ x , y ] ( x 4 , x y , y 2 ) V 1 = { x 3 , x 2 + y , y }
V 2 = { x 2 + x + y , x 3 + x + y , x 3 + x 2 + x ,
x 3 + x 2 + x + y , x + y , x 2 + x , x 2 , x 3 + x 2 ,
x 3 + x 2 + y , x 2 + y , x , x 3 + x }
Figure 1
Z 2 [ x , y ] ( x 3 , x 2 y , y 2 ) V 1 = { x 2 , x y , x 2 + x y }
V 2 = { y , x 2 + y , y + x y , x 2 + y + x y ,
x , x 2 + x , x 2 + x + y , x + x y , x + y ,
x 2 + x + y + x y , x + y + x y , x 2 + x + x y }
Figure 1
Z 2 [ x , y ] ( x 3 , y 3 , y 2 x y ) V 1 = { x 2 , x y , x 2 + x y }
V 2 = { y , x 2 + y , y + x y , x 2 + y + x y ,
x , x 2 + x , x 2 + x + y , x + x y , x + y ,
x 2 + x + y + x y , x + y + x y , x 2 + x + x y }
K 12 ¯ K 3
Z 2 [ x , y ] ( x 3 , y 3 , y 2 x 2 x y ) V 1 = { x 2 , x y , x 2 + x y }
V 2 = { y , x 2 + y , y + x y , x 2 + y + x y ,
x , x 2 + x , x 2 + x + y , x + x y , x + y ,
x 2 + x + y + x y , x + y + x y , x 2 + x + x y }
K 12 ¯ K 3
Z 4 [ x , y ] ( x 3 , x 2 + y 2 , x y + 2 , 2 x , 2 y ) V 1 = { y 2 , 2 , y 2 + 2 }
V 2 = { x , y , x + y , x + 2 , y + 2 , y 2 + y ,
y 2 + x , y 2 + x + y , y 2 + x + 2 ,
y 2 + y + 2 , y 2 + y + x + 2 , x + y + 2 }
K 12 ¯ K 3
Z 4 [ x , y ] ( x 3 , x 2 + y 2 + 2 , x y + 2 , 2 x , 2 y ) V 1 = { y 2 , 2 , y 2 + 2 }
V 2 = { x , y , x + y , x + 2 , y + 2 , y 2 + y ,
y 2 + x , y 2 + x + y , y 2 + x + 2 ,
y 2 + y + 2 , y 2 + y + x + 2 , x + y + 2 }
K 12 ¯ K 3
Z 4 [ x , y ] ( x 3 , y 2 , x y + 2 , 2 x , 2 y ) V 1 = { x 2 , 2 , x 2 + 2 }
V 2 = { x , y , x + y , x + 2 , y + 2 ,
x 2 + x , x 2 + y , x 2 + x + y , x 2 + x + 2 ,
x 2 + y + 2 , x 2 + x + y + 2 , x + y + 2 }
Figure 1
Z 4 [ x , y ] ( x y 2 , x 2 , y 2 + 2 , 2 x , 2 y ) V 1 = { x y , 2 , x y + 2 }
V 2 = { x , x + 2 , x + x y , x + x y + 2 , y ,
y + x y , y + 2 , x + y , y + x y + 2 ,
x + y + x y + 2 , x + y + 2 , x + y + x y }
Figure 1
Z 4 [ x , y ] ( x 3 2 , y 2 , x y , 2 x , 2 y ) V 1 = { y , 2 , y + 2 }
V 2 = { x 2 , x 2 + 2 , x 2 + y + 2 , x 2 + y , x ,
x + y , x + 2 , x 2 + x , x 2 + x + y ,
x + y + 2 , x 2 + x + 2 , x 2 + x + y + 2 }
Figure 1
Z 4 [ x , y ] ( x 2 2 , y 2 , x y , 2 y ) V 1 = { y , 2 x , 2 x + y }
V 2 = { 2 , 2 x + 2 , y + 2 , 2 x + y + 2 , x , 3 x , x + 2 ,
x + y , 3 x + y , 3 x + 2 , 3 x + y + 2 , x + y + 2 }
Figure 1
Z 4 [ x , y ] ( x 2 2 x 2 , y 2 , x y , 2 y ) V 1 = { y , 2 x , 2 x + y }
V 2 = { 2 , 2 x + 2 , y + 2 , 2 x + y + 2 , x , 3 x , x + 2 ,
x + y , 3 x + y , 3 x + 2 , 3 x + y + 2 , x + y + 2 }
Figure 1
Z 4 [ x ] ( x 4 , 2 x ) V 1 = { x 3 , x 3 + 2 , 2 }
V 2 = { x , x 2 , x 2 + 2 , x 3 + x 2 , x 3 + x + 2 ,
x + 2 , x 3 + x + 2 , x 3 + x 2 + x + 2 ,
x 2 + x + 2 , x 3 + x , x 2 + x , x 3 + x 2 + x }
Figure 1
Z 4 [ x ] ( x 3 , 2 x 2 ) V 1 = { x 2 , 2 x , x 2 + 2 x }
V 2 = { 2 , x 2 + 2 , 2 x + 2 , x 2 + 2 x + 2 , x ,
3 x , x 2 + x , x + 2 , x 2 + 3 x , 3 x + 2 ,
x 2 + 3 x + 2 , x 2 + x + 2 , x 2 + 2 x + 2 }
Figure 1
Z 8 [ x ] ( 4 x , x 2 ) V 1 = { 4 , 2 x , 2 x + 4 }
V 2 = { 2 , 6 , x , 3 x , x + 4 , 3 x + 4 , x + 2 ,
x + 6 , 3 x + 2 , 3 x + 6 , 2 x + 2 , 2 x + 6 , }
Figure 1
Z 8 [ x ] ( 4 x , x 2 2 x ) V 1 = { 4 , 2 x , 2 x + 4 }
V 2 = { 2 , 6 , x , 3 x , x + 4 , 3 x + 4 , x + 2 ,
x + 6 , 3 x + 2 , 3 x + 6 , 2 x + 2 , 2 x + 6 , }
Figure 1
Z 8 [ x ] ( 4 x , x 2 2 x 4 ) V 1 = { 4 , 2 x , 2 x + 4 }
V 2 = { 2 , 6 , x , 3 x , x + 4 , 3 x + 4 , x + 2 , x + 6 ,
3 x + 2 , 3 x + 6 , 2 x + 2 , 2 x + 6 , }
Figure 1
Z 16 [ x ] ( 2 x , x 2 ) V 1 = { 8 , x , x + 8 }
V 2 = { 2 , 4 , 6 , 10 , 12 , 14 , x + 2 , x + 4 , x + 6 ,
x + 10 , x + 12 , x + 14 , 3 x + 6 , 2 x + 2 , 2 x + 6 , }
Figure 1
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

Asir, T.; Mano, K.; Alsuraiheed, T. Classification of Genus Three Zero-Divisor Graphs. Symmetry 2023, 15, 2167. https://doi.org/10.3390/sym15122167

AMA Style

Asir T, Mano K, Alsuraiheed T. Classification of Genus Three Zero-Divisor Graphs. Symmetry. 2023; 15(12):2167. https://doi.org/10.3390/sym15122167

Chicago/Turabian Style

Asir, Thangaraj, Karuppiah Mano, and Turki Alsuraiheed. 2023. "Classification of Genus Three Zero-Divisor Graphs" Symmetry 15, no. 12: 2167. https://doi.org/10.3390/sym15122167

APA Style

Asir, T., Mano, K., & Alsuraiheed, T. (2023). Classification of Genus Three Zero-Divisor Graphs. Symmetry, 15(12), 2167. https://doi.org/10.3390/sym15122167

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