Next Article in Journal
Advanced Fitted Mesh Finite Difference Strategies for Solving ‘n’ Two-Parameter Singularly Perturbed Convection–Diffusion System
Previous Article in Journal
On Equivalents of the Riemann Hypothesis Connected to the Approximation Properties of the Zeta Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings

1
Department of Mathematics, College of Science, King Khalid University, Abha 61413, Saudi Arabia
2
Department of Mathematics, College of Science, Jazan University, P.O. Box 114, Jazan 45142, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(3), 170; https://doi.org/10.3390/axioms14030170
Submission received: 5 February 2025 / Revised: 22 February 2025 / Accepted: 25 February 2025 / Published: 26 February 2025

Abstract

:
R c represents commutative rings that have unity elements. The collection of all zero-divisor elements in R c are represented by D ( R c ) . We denote an extended zero-divisor graph by the notation ( R c ) of R c . This graph has a set of vertices in D ( R c ) * . The graph ( R c ) illustrates interactions among the zero-divisor elements of R c . Specifically, two different vertices u and y are connected in ( R c ) iff u R c Ann ( y ) is non-null or y R c Ann ( u ) is non-null. The main idea for this work is to systematically analyze the ring R c which is finite for the unique aspect of their extended zero-divisor graph. This study particularly focuses on instances where the extended zero-divisor graph has a genus or crosscap of two. Furthermore, this work aims to thoroughly characterize finite ring R c wherein the extended zero-divisor graph ( R c ) has an outerplanarity index of two. Finally, we determine the book thickness of ( R c ) for genus at most one.

1. Introduction

The exploration of different graphs linked to algebraic systems is extensive and is an emerging trend in modern research. The focus of the present work is based on the classification of the graphs of the theoretical ring structure and vice versa. Special attention is paid to understanding the correspondence through the algebraic system for known entities with graphical properties of the associated structures. When a combinatorial entity is assigned to an algebraic system, this gives rise to algebraic and combinatorial problems. Consequently, this is an important area for the investigation of graph structures related to rings with commutativity. Let R c denote a commutative ring that has a non-null unit element. D ( R c ) is assumed to represent a collection of all zero-divisor elements. Innovative concepts on zero-divisor graphs were introduced and investigated by Beck [1] in commutative rings with unity element, considering elements of this ring as vertices of the graph and examining the dynamics of the coloring of the graph. Taking this concept, Anderson and Livingston [2] defined ( R c ) , where vertices are non-null zero-divisors and connected if the product of the vertices are zero (see [3,4,5,6,7,8] for more details). Adding this mathematical development, Badawi [9] introduced the annihilator graph A G ( R c ) , with a set of vertices D ( R c ) * , where two different vertices, u and y, are connected iff Ann ( u v ) Ann ( u ) Ann ( y ) .
A more recent work by Bakhtyiari et al. [10,11] presented the extended zero-divisor graph for R c , given by ( R c ) , that is, the undirected graph with a set of vertices D ( R c ) * , where two different vertices, u and y, are connected iff u R c Ann ( y ) 0 or y R c Ann ( u ) 0 . In [10], the authors investigated properties based on the extended zero-divisor graph and given the relationships between ( R c ) and ( R c ) .
Rehman et al. [12] characterized rings that are finite and commutative with an extended zero-divisor graph that is isomorphic in accordance with existing graphs in the literature with the classification of rings that are finite and commutative with an extended zero-divisor graph that is planar, projective, or toroidal. Ali et al. [13] computed eccentric topological indices of zero-divisor graphs. Recently, Mohd et al. [14] investigated the genus and crosscap-two annihilator graph of commutative rings.
Motivated by the above research, we consider R c as a ring that is finite and commutative containing an identity element. It is characterized by sets, such as D ( R c ) that denote the collection of zero-divisor elements, U ( R c ) represents the collection of all unit elements, M ( R c ) encompasses the collection of minimal prime ideals, and N ( R c ) shows the collection of nilpotent elements. The notation A n denotes the ring over integer modulo n. K q stands for the field with q elements. Notably, T * = T { 0 } of R c . For b R c , Ann ( b ) stands for the annihilators of b . For more details regarding theoretical ring terminologies, readers can review [15].
This paper extends the investigation by categorizing finite commutative rings R c with ( R c ) , which have a genus and crosscap two. In addition, an identification is provided for R c , where ( R c ) has an outerplanarity index of 2. A determination of the minimally non-outerplanar graph is also given. Finally, we determine the book thickness of ( R c ) for a genus of, at most, one.

2. Preliminaries

This section contains a short overview of symbols, principles, and results related to the genus of graphs, establishing the foundation for the following sections.
We consider a simple graph H that is undirected and has V as the vertex set and E as the edge set. K m stands for a complete graph characterized by a tuple of vertices linked with an edge. A partite graph is a graph with vertex sets that are partitioned into different subsets so that no two vertices are linked within the same set. In general, an s-partite graph is partitioned into s subsets so that none of two vertices are connected within the same set. Next to the s-partite, we have a complete s-partite graph that has vertices connected to another vertex not in the same set. K p , q is a special case of the 2-partite graph with a part size that is ( p , q), with each vertex from one part connected to every vertex in the other part. For more details on graph theory, readers refer to [16,17].
We represent a given graph on a surface in topological graph theory. In that sense, consider S h represents a sphere where h stands for handles, which is a positive integer, indicating genus h for its oriented surface. ( H ) , refers genus which is smallest integer h allowing H for embedding in S h .
In a visual sense, H is considered as embedded on a surface if H depicts on the surface with edges divided on a vertex that is shared by a pair of vertices. A planar graph has 0 genus, while a toroidal graph has 1 . Furthermore, it is worth noting that γ ( H ) γ ( J ) indicates that H is a subgraph of J. In graph theory based on topology, using Euler’s formula, we determine that the relationship for a finite connected graph H is written as n + f e = 2 2 γ , where n = no. of vertices, e = no. of edges, γ = genus, and f = no. of faces due to cellular embedded process of H on S γ . For the combined combinatorial identities and various inequalities, this formula plays the role of a powerful tool for exploring and demonstrating the existence of concerned graph embeddings. To search more thoroughly for embedded graphs on a surface, refer to [17]. Some more details on genus one for zero-divisor graphs, readers can refer to [18,19]. The zero-divisor planar graph is given in [20], whereas computations on radio labeling associated with the zero-divisor graph of a commutative ring is given in [21], and further eccentric topological indices based on the edges of zero-divisor graphs are studied in [22].
Some results and bounds based on genus are presented below.
Proposition 1
([10], Lemma 2.2). With R c as a commutative ring, we have the following:
(i.)
ϱ ς being the edge of ( R c ) for ϱ , ς D ( R c ) * , we obtain ϱ ς , which is an edge of ( R c ) .
(ii.)
ϱ ς being not an edge of ( R c ) for ϱ , ς D ( R c ) * , we obtain Ann ( ϱ ) = Ann ( ς ) . The indirect part is true only if R c is a reduced ring.
(iii.)
Ann ( ς ) Ann ( ϱ ) or Ann ( ϱ ) Ann ( ς ) for ϱ , ς D ( R c ) * , we obtain ϱ ς as an edge of ( R c ) .
(iv.)
ϱ R c Ann ( ϱ ) being non-null for ϱ D ( R c ) * , we obtain ϱ, which is connected to all other vertices in ( R c ) . Specifically, ϱ N ( R c ) * , we obtain ϱ, which is connected to the rest of the vertices in ( R c ) .
(v.)
( R c ) [ N ( R c ) * ] is a complete subgraph.
The following example shows that graph ( R c ) and graph ( R c ) are not identical.
Axioms 14 00170 i001
Theorem 1
([12]). With ( R c , ξ ) as a commutative local ring, ( R c ) is a complete graph.
The following are some known results of the genus of complete graphs and complete bipartite graphs.
Lemma 1
([17]). Let p , q 2 . Then,
γ ( K p , q ) = 1 4 ( p 2 ) ( q 2 ) .
Specifically, γ ( K 4 , 4 ) = γ ( K 3 , q ) = 1 if q = 3 , , 6 and γ ( K 5 , 4 ) = γ ( K 6 , 4 ) = γ ( K 3 , p ) = 2 , if p = 7 , , 10 .
Lemma 2
([17]). Let p 3 . Then,
γ ( K p ) = 1 12 ( p 3 ) ( p 4 ) .
Specifically, γ ( K p ) = 1 if p = 5 , 6 , 7 and γ ( K 8 ) = 2 ,
Lemma 3
([23]). H being connected graph and e being its edges with vertices y 3 , the following formula holds:
γ ( H ) e 6 v 2 + 1 .

3. Genus of ( R c )

Finite commutative rings R c with an identity element are thoroughly examined where graph ( R c ) has a genus of two. Using the Euler characteristic equation and deletion–insertion method, we eliminate some steps that lead to yielding a higher genus.
Theorem 2
([12], Theorems 3.2, 3.3, 3.5).  R c being a finite commutative ring, we obtain ( R c ) , which is planar, iff R c is equivalent to one of the rings listed below:
A 4 , A 2 [ x ] x 2 , A 9 , A 3 [ x ] x 2 , A 8 , A 2 [ x ] x 3 , A 4 [ x ] x 3 , x 2 2 , A 4 [ x ] 2 x , x 2 , A 2 [ x , y ] x 2 , x y , y 2 , K 4 [ x ] x 2 , A 4 [ x ] x 2 + x + 1 , A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , A 2 × F or A 3 × F ,   for   finite   F .
Theorem 3
([12], Theorem 4.1).  ( A , ξ ) being a finite commutative local ring, we obtain γ ( ( R c ) ) = 1 iff R c is equivalent amongst the following:
A 49 , A 7 [ x ] x 2 , A 16 , A 2 [ x ] x 4 , A 4 [ x ] x 2 2 , x 4 , A 2 [ x ] x 3 2 , x 4 , A 4 [ x ] x 3 + x 2 2 , x 4 , A 2 [ x , y ] x 3 , x y , y 2 x 2 , A 2 [ x ] x 3 , x 2 2 x , A 8 [ x ] x 2 4 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 2 , y 3 , A 4 [ x ] x 2 , A 4 [ x , y ] x 2 , y 2 , x y 2 , A 2 [ x , y ] x 2 , y 2 , A 2 [ x , y ] x 2 , y 2 , x y , A 4 [ x ] x 3 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 , A 8 [ x ] x 2 , 2 x , K 8 [ x ] x 2 , A 4 [ x ] x 3 + x + 1 , A 4 [ x , y ] 2 x , 2 y , x 2 , y 2 , x y   or   A 2 [ x , y , z ] x , y , z 2 .
Theorem 4
([12], Theorems 4.2, 4.4). Let R c be a finite commutative non-local ring. Then, γ ( ( R c ) ) = 1 iff R c is equivalent to one of the rings listed below:
K 4 × K 4 , K 4 × A 5 , A 5 × A 5 , K 4 × A 7 , A 2 × A 2 × A 2 , A 4 × A 3 ,   or   A 2 [ x ] x 2 × A 3 .
Theorem 5.
Let ( R c , ξ ) be a finite local commutative ring. Then, γ ( ( R c ) ) = 2 iff R c is equivalent to one of the rings listed below:
A 27 , A 9 [ x ] 3 x , x 2 3 , A 9 [ x ] 3 x , x 2 6 , A 3 [ x ] x 3 , A 3 [ x ] x , y 2 , A 9 [ x ] 3 , x 2 , K 9 [ x ] x 2   or   A 9 [ x ] x 2 + 1 .
Proof. 
We have that R c is local. Next, graph ( R c ) is completed using Theorem 1. Thus, γ ( ( R c ) ) = 2 iff | D ( R c ) * | = 8 . □
In the Theorem given below, we calculate all finite reduced non-local rings R c for which ( R c ) has a genus of two.
Theorem 6.
With R c being finite commutative rings that are non-local and reduced, γ ( ( R c ) ) = 2 iff R c is equivalent to one of the rings listed below:
K 4 × K 8 , K 4 × K 9 , K 4 × K 11 ,   or   A 5 × A 7 .
Proof. 
Consider γ ( ( R c ) ) = 2 . Since R c is a finite reduced non-local commutative ring, A F 1 × F 2 × × F n , with each F i a field having the property of n 2 . Let n = 4 , 5 , 6 , . Let x 1 = ( 1 , 0 , , 0 ) , x 2 = ( 0 , 1 , 0 , 0 ) , x 3 = ( 0 , 0 , 1 , 0 , , 0 ) , x 4 = ( 0 , 0 , 0 , 1 , 0 , , 0 ) , y 1 = ( 1 , 1 , 0 , , 0 ) , y 2 = ( 1 , 0 , 1 , 0 , , 0 ) , y 3 = ( 0 , 1 , 1 , 0 , , 0 ) , y 4 = ( 1 , 0 , 0 , 1 , 0 , , 0 ) , y 5 = ( 0 , 1 , 0 , 1 , 0 , , 0 ) , y 6 = ( 0 , 0 , 1 , 1 , 0 , , 0 ) and y 7 = ( 0 , 1 , 1 , 1 , 0 , , 0 ) D ( R c ) * . Since A n n ( x 1 ) A n n ( y 1 ) , A n n ( x 1 ) A n n ( y 2 ) , x 1 y 3 = 0 , A n n ( x 1 ) A n n ( y 4 ) , x 1 y 5 = 0 , x 1 y 6 = 0 , x 1 y 7 = 0 , A n n ( x 2 ) A n n ( y 1 ) , x 2 y 2 = 0 , A n n ( x 2 ) A n n ( y 3 ) , x 2 y 4 = 0 , A n n ( x 2 ) A n n ( y 5 ) , x 2 y 6 = 0 , A n n ( x 2 ) A n n ( y 7 ) , x 3 y 1 = 0 , A n n ( x 3 ) A n n ( y 2 ) , A n n ( x 3 ) A n n ( y 3 ) , x 3 y 4 = 0 , x 3 y 5 = 0 , A n n ( x 3 ) A n n ( y 6 ) , A n n ( x 3 ) A n n ( y 7 ) , x 4 y 1 = 0 , x 4 y 2 = 0 , x 4 y 3 = 0 , A n n ( x 4 ) A n n ( y 4 ) , A n n ( x 4 ) A n n ( y 5 ) , A n n ( x 4 ) A n n ( y 6 ) and A n n ( x 4 ) A n n ( y 7 ) . Using Lemma 1, ( R c ) contains K 4 , 7 induced by the set { x 1 , x 2 , x 3 , x 4 } { y 1 , y 2 , , y 7 } with Lemma 1. This shows that γ ( ( R c ) ) > 2 using Lemma 1 is contradictory. Hence, 3 n .
  • Let n = 3 . Our claim is | F i | = 2 for every 1 i 3 . Conversely, | F 1 | 3 with 1 α F 1 * . Let a 1 = ( 1 , 0 , 0 ) , a 2 = ( α , 0 , 0 ) , a 3 = ( 0 , 1 , 0 ) , a 4 = ( 1 , 1 , 0 ) , a 5 = ( α , 1 , 0 ) , a 6 = ( 0 , 0 , 1 ) , a 7 = ( 1 , 0 , 1 ) , a 8 = ( α , 0 , 1 ) , and a 9 = ( 0 , 1 , 1 ) D ( R c ) * . The set { a 1 , a 2 , , a 9 } inducing the subgraph has a minimum of 33 edges with 9 vertices. Using Lemma 3, γ ( ( R c ) ) 3 is contradictory. This shows that R c A 2 × A 2 × A 2 . Using Theorem 4, γ ( ( R c ) ) = 1 , which again contradicts.
Now, let n = 2 | M ( R c ) | = 2 and using ([10], Theorem 4.2), ( R c ) = ( R c ) . Using ([24], Theorem 4), A K 4 × K 9 , K 4 × K 8 , A 5 × A 7 , or K 4 × K 11 .
Conversely, if A K 4 × K 9 , K 4 × K 8 , A 5 × A 7 , or K 4 × K 11 , then by ([10], Theorem 4.2), ( R c ) = ( R c ) . Hence, γ ( ( R c ) ) = 2 by ([24], Theorem 4). □
Theorem 7.
Let R c be a finite non-local non-reduced commutative ring. Then, γ ( ( R c ) ) 2 .
Proof. 
The ring R c is non-infinite, non-reduced, and non-local, so A R c 1 × R c 2 × × R c n × F 1 × F 2 × F 3 × × F m , where every ( R c i , ξ i ) is local, having the maximal ideal ξ i , with field F i for each i with n , m 1 . Consider n is greater than or equal to 2 . Since ξ i 0 , a i ξ i * A n n ( a i ) = ξ i for every i . Consider x 1 = ( 1 , 0 , 0 , , 0 ) ,   x 2 = ( u 1 , 0 , 0 , , 0 ) ,   x 3 = ( a 1 , 0 , , 0 ) ,   x 4 = ( 0 , a 2 , 0 , , 0 ) , y 1 = ( a 1 , 1 , 0 , , 0 ) ,   y 2 = ( a 1 , u 1 , 0 , , 0 ) ,   y 3 = ( a 1 , a 2 , 0 , , 0 ) ,   y 4 = ( u 1 , a 2 , 0 , , 0 ) , y 5 = ( 1 , a 2 , 0 , , 0 ) , y 6 = ( 0 , u 2 , 0 , , 0 ) ,   y 7 = ( 0 , 1 , 0 , , 0 ) D ( R c ) * , where 1 u i U ( R c i ) .
Since A n n ( x 1 ) A n n ( y 1 ) ,   A n n ( x 1 ) A n n ( y 2 ) ,   A n n ( x 1 ) A n n ( y 3 ) ,   A n n ( x 1 ) A n n ( y 4 ) ,   A n n ( x 1 ) A n n ( y 5 ) ,   x 1 y 6 = 0 ,   x 1 y 7 = 0 ,   A n n ( x 2 ) A n n ( y 1 ) ,   A n n ( x 2 ) A n n ( y 2 ) ,   A n n ( x 2 ) A n n ( y 3 ) ,   A n n ( x 2 ) A n n ( y 4 ) ,   A n n ( x 2 ) A n n ( y 5 ) ,   x 2 y 6 = 0 , x 2 y 7 = 0 ,   A n n ( x 3 ) A n n ( y 1 ) ,   A n n ( x 3 ) A n n ( y 2 ) ,   A n n ( x 3 ) A n n ( y 3 ) ,   A n n ( x 3 ) A n n ( y 4 ) ,   A n n ( x 3 ) A n n ( y 5 ) ,   x 3 y 6 = 0 ,   x 3 y 7 = 0 ,   A n n ( x 4 ) A n n ( y 1 ) ,   A n n ( x 4 ) A n n ( y 2 ) ,   A n n ( x 4 ) A n n ( y 3 ) ,   A n n ( x 4 ) A n n ( y 4 ) .
A n n ( x 4 ) A n n ( y 5 ) ,   x 4 y 6 = 0 , x 4 y 7 = 0 , ( R c ) contains a subgraph of K 4 , 7 induced by the set { x 1 , x 2 , x 3 , x 4 } { y 1 , y 2 , , y 7 } . Hence, γ ( ( R c ) ) > 2 using Lemma 1.
Now, suppose that m 2 . Consider w 1 = ( 1 , 0 , 0 , , 0 ) ,   w 2 = ( 0 , 1 , 0 , , 0 ) , w 3 = ( 0 , 0 , 1 , 0 , , 0 ) ,   w 4 = ( a 1 , 0 , 0 , , 0 ) ,   z 1 = ( 1 , 1 , 0 , , 0 ) ,   z 2 = ( 1 , 0 , 1 , 0 , , 0 ) , z 3 = ( u 1 , 1 , 0 , , 0 ) ,   z 4 = ( u 1 , 0 , 1 , 0 , , 0 ) ,   z 5 = ( a 1 , 1 , 0 , , 0 ) ,   z 6 = ( a 1 , 0 , 1 , 0 , , 0 ) , and z 7 = ( a 1 , 1 , 1 , 0 , , 0 ) D ( R c ) * .
Since A n n ( w 1 ) A n n ( z 1 ) ,   A n n ( w 1 ) A n n ( z 2 ) ,   A n n ( w 1 ) A n n ( z 3 ) ,   A n n ( w 1 ) A n n ( z 4 ) ,   A n n ( z 5 ) A n n ( w 1 ) ,   A n n ( w 1 ) A n n ( z 6 ) ,   A n n ( z 7 ) A n n ( w 1 ) ,   A n n ( w 2 ) A n n ( z 1 ) ,   w 2 z 2 = 0 ,   A n n ( w 2 ) A n n ( z 3 ) ,   w 2 z 4 = 0 ,   A n n ( w 2 ) A n n ( z 5 ) ,   A n n ( w 2 ) A n n ( z 6 ) ,   A n n ( w 2 ) A n n ( z 7 ) ,   w 3 z 1 = 0 ,   A n n ( w 3 ) A n n ( z 2 ) ,   A n n ( w 3 ) A n n ( z 3 ) , A n n ( w 3 ) A n n ( z 4 ) ,   w 3 z 5 = 0 ,   A n n ( w 3 ) A n n ( z 6 ) ,   w 3 z 7 = 0 ,   A n n ( w 4 ) A n n ( z 1 ) , A n n ( w 4 ) A n n ( z 2 ) ,   A n n ( w 4 ) A n n ( z 3 ) ,   A n n ( w 4 ) A n n ( z 4 ) ,   A n n ( w 4 ) A n n ( z 5 ) , A n n ( w 4 ) A n n ( z 6 ) , and A n n ( w 4 ) A n n ( z 7 ) , then using Lemma 1, ( R c ) contains a subgraph of K 4 , 7 induced by the set { w 1 , w 2 , w 3 , w 4 } { z 1 , z 2 , , z 7 } . Hence, γ ( ( R c ) ) > 2 using Lemma 1.
Suppose that m = n = 1 and | ξ 1 * | = 2 . Then, R c 1 A 9 or A 3 [ x ] x 2 , and hence, | U ( R c 1 ) | = 6 . Let a , b ξ 1 * a b = 0 and A n n ( a ) = ξ 1 . Consider r 1 = ( 1 , 0 ) ,   r 2 = ( u 1 , 0 ) ,   r 3 = ( u 2 , 0 ) ,   r 4 = ( u 3 , 0 ) ,   s 1 = ( 0 , 1 ) ,   s 2 = ( a , 0 ) ,   s 3 = ( b , 0 ) ,   s 4 = ( a , 1 ) ,   s 5 = ( b , 1 ) D ( R c ) * , where u i U ( R c 1 ) . Since r i s j for every i , j , ( R c ) contains K 5 , 5 . Hence, γ ( ( R c ) ) > 2 using Lemma 1. Hence, | ξ 1 * | 2 .
Suppose that m = n = 1 and | ξ 1 * | 3 , then | U ( R c 1 ) | 4 . Assume a , b , c as members of ξ 1 * , which is a member of a b = b c = 0 , with A n n ( a ) = ξ 1 . Let d 1 = ( u 1 , 0 ) ,   d 2 = ( u 2 , 0 ) ,   d 3 = ( u 3 , 0 ) ,   d 4 = ( u 4 , 0 ) ,   e 1 = ( a , 0 ) ,   e 2 = ( b , 0 ) ,   e 3 = ( c , 0 ) ,   e 4 = ( a , 1 ) ,   e 5 = ( b , 1 ) ,   e 6 = ( c , 1 ) , and e 7 = ( 0 , 1 ) D ( R c ) * , where u i U ( R c 1 ) . Since d i e j for every i , j , ( R c ) contains K 4 , 7 , using Lemma 1. Hence, γ ( ( R c ) ) > 2 using Lemma 1.
Now, suppose that n = m = 1 , | ξ 1 * | = 1 and | F 1 | 5 and x ξ 1 * x 2 = 0 . Consider a 1 = ( 0 , 1 ) ,   a 2 = ( 0 , x 1 ) ,   a 3 = ( 0 , x 2 ) ,   a 4 = ( 0 , x 3 ) ,   b 1 = ( 1 , 0 ) ,   b 2 = ( x , 0 ) ,   b 3 = ( u , 0 ) ,   b 4 = ( x , 1 ) , b 5 = ( x , x 1 ) ,   b 6 = ( x , x 2 ) ,   b 7 = ( x , x 3 ) D ( R c ) * , where 1 x 1 , x 2 , x 3 F 1 * and 1 u U ( R c 1 ) . Since a i b j for every i , j , ( R c ) contains K 4 , 7 . Hence, γ ( ( R c ) ) > 2 using Lemma 1.
Now, suppose that n = m = 1 , | ξ 1 * | = 1 and | F 1 | = 2 or | F 1 | = 3 , then, with Theorems 2 and 4, γ ( ( R c ) ) 2 .
Finally, suppose that n = m = 1 , | ξ 1 * | = 1 and | F 1 | = 4 . Then, ( R c ) contains 32 edges and 9 vertices. Hence, γ ( ( R c ) ) > 2 using Lemma 3. □

4. Crosscap of ( R c )

In this section, we classify the finite commutative rings R c for which the extended zero-divisor graph ( R c ) is a Klein bottle.
For 0 k , N k refers to a sphere having k crosscaps. It is worth noting that a connected compact surface could be matched topologically with N k for 0 k . γ ¯ ( H ) or the non-orientable genus is the least positive integer k that is written for crosscap numbers and embedded to H in N k . The projective graph has a crosscap of 1, and a Klein bottle graph has a crosscap of 2.
The results given below provide crosscap numbers for complete and bipartite graphs. The ceiling function x signifies the least positive integer that is ≥x, for x as a real number.
Lemma 4
([17]). For n 3 ,
γ ¯ ( K n ) = ( n 3 ) ( n 4 ) 6 if n 3 and n 7 ; 3 if n = 7 .
Lemma 5
([17]). For n 2 and m 2 ,
γ ¯ ( K m , n ) = ( m 2 ) ( n 2 ) 2 .
Theorem 8
([12]). Let R c be a finite commutative ring. Then, γ ¯ ( ( R c ) ) = 1 iff R c is equivalent to one of the rings listed below:
A 49 , A 7 [ x ] x 2 , K 4 × K 4 , K 4 × A 5 ,   or   A 2 × A 2 × A 2 .
Now, we classify the finite ring R c as having γ ¯ ( ( R c ) ) = 2 .
Theorem 9.
Let R c be a finite commutative ring. Then, γ ¯ ( ( R c ) ) = 2 iff R c is equivalent to one of the rings listed below:
K 4 × A 7 , A 5 × A 5 , A 4 × A 3 ,   or   A 2 [ x ] x 2 × A 3 .
Proof. 
Consider γ ¯ ( ( R c ) ) = 2 . Since R c is finite, R c R c 1 × R c 2 × × R c m , where ( R c i , ξ i ) is a local ring for every i and m = 1 , 2 , 3 , . Let m = 4 , 5 , . Consider p 1 = ( 1 , 0 , 0 , 0 , 0 , , 0 ) ,   p 2 = ( 0 , 1 , 0 , 0 , 0 , , 0 ) ,   p 3 = ( 1 , 1 , 0 , 0 , , 0 ) ,   p 4 = ( 1 , 0 , 1 , 0 , 0 , 0 , , 0 ) ,   q 1 = ( 0 , 0 , 1 , 0 , 0 , 0 , , 0 ) ,   q 2 = ( 0 , 0 , 0 , 1 , 0 , 0 , 0 , , 0 ) ,   q 3 = ( 1 , 0 , 0 , 1 , 0 , 0 , 0 , , 0 ) ,   q 4 = ( 0 , 1 , 1 , 0 , 0 , 0 , 0 ) ,   q 5 = ( 0 , 0 , 1 , 1 , 0 , 0 , , 0 ) D ( R c ) * . Since A n n ( p 1 ) A n n ( q 1 ) , A n n ( p 1 ) A n n ( q 2 ) , A n n ( p 1 ) A n n ( q 3 ) ,   A n n ( p 1 ) A n n ( q 4 ) ,   A n n ( p 1 ) A n n ( q 5 ) ,   A n n ( p 2 ) A n n ( q 1 ) ,   A n n ( p 2 ) A n n ( q 2 ) ,   A n n ( p 2 ) A n n ( q 3 ) ,   A n n ( p 2 ) A n n ( q 4 ) ,   A n n ( p 2 ) A n n ( q 5 ) ,   A n n ( p 3 ) A n n ( q 1 ) ,   A n n ( p 3 ) A n n ( q 2 ) ,   A n n ( p 3 ) A n n ( q 3 ) ,   A n n ( p 3 ) A n n ( q 4 ) ,   A n n ( p 3 ) A n n ( q 5 ) ,   A n n ( p 4 ) A n n ( q 1 ) ,   A n n ( p 4 ) A n n ( q 1 ) ,   A n n ( p 4 ) A n n ( q 2 ) ,   A n n ( p 4 ) A n n ( q 3 ) ,   A n n ( p 4 ) A n n ( q 4 ) ,   A n n ( p 4 ) A n n ( q 5 ) , then using Lemma 1, p i q j for every i , j . Hence, ( R c ) contains K 4 , 5 induced by the set { p 1 , p 2 , p 3 , p 4 } { q 1 , q 2 , , q 5 } . This shows that γ ¯ ( ( R c ) ) > 2 using Lemma 5, which is contradictory. Thus, m 3 .
Case 1.
Let m = 3 . If R c 1 is not a field with a maximal ideal ξ 1 that is non-null, then ∃ a 1 ξ 1 * A n n ( a 1 ) = ξ 1 . Consider r 1 = ( 1 , 0 , 0 ) ,   r 2 = ( 0 , 1 , 0 ) ,   r 3 = ( 0 , 0 , 1 ) , r 4 = ( a 1 , 0 ) ,   s 1 = ( 1 , 1 , 0 ) ,   s 2 = ( 1 , 0 , 1 ) ,   s 3 = ( u 1 , 1 , 0 ) ,   s 4 = ( u 1 , 0 , 1 ) , and s 5 = ( a 1 , 1 , 0 ) D ( R c ) * . Since A n n ( r 1 ) A n n ( s 1 ) ,   A n n ( r 1 ) A n n ( s 2 ) ,   A n n ( r 1 ) A n n ( s 3 ) ,   A n n ( r 1 ) A n n ( s 4 ) ,   A n n ( s 5 ) A n n ( r 1 ) ,   A n n ( r 2 ) A n n ( s 1 ) ,   r 2 s 2 = 0 ,   A n n ( r 2 ) A n n ( s 3 ) ,   r 2 s 4 = 0 ,   A n n ( r 2 ) A n n ( s 5 ) ,   r 1 s 1 = 0 ,   A n n ( r 3 ) A n n ( s 2 ) ,   A n n ( r 3 ) A n n ( s 3 ) ,   A n n ( r 3 ) A n n ( s 4 ) ,   r 3 s 5 = 0 ,   A n n ( r 4 ) A n n ( s 1 ) ,   A n n ( r 4 ) A n n ( s 2 ) ,   A n n ( r 4 ) A n n ( s 3 ) ,   A n n ( r 4 ) A n n ( s 4 ) ,   A n n ( r 4 ) A n n ( s 5 ) , then using Lemma 1, ( R c ) contains a subgraph of K 4 , 5 induced by the set { r 1 , r 2 , r 3 , r 4 } { s 1 , s 2 , , s 5 } . Hence, γ ¯ ( ( R c ) ) > 2 using Lemma 5, which contradicts. Hence, R c 1 is a field. Similarly, one can show that both R c 2 , R c 3 are fields.
Let | R c 1 | 3 . Consider w 1 = ( 1 , 0 , 0 ) ,   w 2 = ( 0 , 1 , 0 ) ,   w 3 = ( 0 , 0 , 1 ) , w 4 = ( a , 1 , 0 ) ,   w 4 = ( 1 , 0 , 1 ) ,   w 5 = ( 0 , 1 , 1 ) ,   z 6 = ( a , 0 , 0 ) ,   w 7 = ( a , 0 , 1 ) D ( R c ) * , where 1 a R c 1 * . Since w i w j for every i , j , then ( R c ) contains K 7 that is a subgraph and implies that γ ¯ ( ( R c ) ) 3 using Lemma 4, which contradicts. Hence, | R c 1 | = 2 . Similarly, we can show that | R c 2 | = | R c 3 | = 2 . Hence, R c A 2 × A 2 × A 2 , which contradicts Theorem 8.
Case 2.
Let m = 2 . If R c i is a local ring with non-null maximal ideals ξ i for every i = 1 , 2 , then a i ξ i * A n n ( a i ) = ξ i with i = 1 , 2 . Let p 1 = ( 1 , 0 ) , p 2 = ( u 1 , 0 ) , p 3 = ( a 1 , 0 ) , p 4 = ( 0 , a 2 ) , q 1 = ( a 1 , 1 ) , q 2 = ( a 1 , u 1 ) , q 3 = ( a 1 , a 2 ) , q 4 = ( u 1 , a 2 ) , q 5 = ( 1 , a 2 ) D ( R c ) * , where 1 u i U ( R c i ) . Since A n n ( p 1 ) A n n ( q 1 ) , A n n ( p 1 ) A n n ( q 2 ) ,   A n n ( p 1 ) A n n ( q 3 ) ,   A n n ( p 1 ) A n n ( q 4 ) ,   A n n ( p 1 ) A n n ( q 5 ) ,   A n n ( p 2 ) A n n ( q 1 ) ,   A n n ( p 2 ) A n n ( q 2 ) ,   A n n ( p 2 ) A n n ( q 3 ) ,   A n n ( p 2 ) A n n ( q 4 ) ,   A n n ( p 2 ) A n n ( q 5 ) ,   A n n ( p 3 ) A n n ( q 1 ) ,   A n n ( p 3 ) A n n ( q 2 ) ,   A n n ( p 3 ) A n n ( q 3 ) ,   A n n ( p 3 ) A n n ( q 4 ) ,   A n n ( p 3 ) A n n ( q 5 ) , A n n ( p 4 ) A n n ( q 1 ) ,   A n n ( p 4 ) A n n ( q 2 ) ,   A n n ( p 4 ) A n n ( q 3 ) ,   A n n ( p 4 ) A n n ( q 4 ) ,   A n n ( p 4 ) A n n ( q 5 ) , ( A ) contains a subgraph of K 4 , 5 induced by the set { p 1 , p 2 , p 3 , p 4 } { q 1 , q 2 , , q 5 } . Thus, γ ¯ ( ( R c ) ) > 2 using Lemma 5, which contradicts. Hence, R c 1 or R c 2 is a field.
If R c 1 and R c 2 both are fields, then | M ( R c ) | = 2 and by ([10], Theorem 4.2), ( R c ) = ( R c ) . Using ([25], Theorem 3.11), A K 4 × A 7 or A 5 × A 5 .
Suppose that R c 1 is not a field with ξ 1 0 and that R c 2 is a field. Let | ξ 1 * | = 2 . Then, R c 1 A 9 or A 3 [ x ] x 2 , and hence, | U ( R c 1 ) | = 6 . Let a , b ξ 1 * a b = 0 and A n n ( a ) = ξ 1 . Consider x 1 = ( 1 , 0 ) , x 2 = ( u 1 , 0 ) , x 3 = ( u 2 , 0 ) , x 4 = ( u 3 , 0 ) , y 1 = ( 0 , 1 ) , y 2 = ( a , 0 ) , y 3 = ( b , 0 ) , y 4 = ( a , 1 ) , y 5 = ( b , 1 ) D ( R c ) * , where u i U ( R c 1 ) . Since x i s j for every i , j , ( R c ) contains K 4 , 5 , which contradicts when Lemma 5 is used. Hence, | ξ 1 * | 2 .
Suppose that | ξ 1 * | 3 , then | U ( R c 1 ) | 4 . Let a , b , c ξ 1 * a b = b c = 0 and A n n ( a ) = ξ 1 . Consider d 1 = ( u 1 , 0 ) , d 2 = ( u 2 , 0 ) , d 3 = ( u 3 , 0 ) , d 4 = ( u 4 , 0 ) , e 1 = ( a , 0 ) , e 2 = ( b , 0 ) , e 3 = ( c , 0 ) , e 4 = ( a , 1 ) , and e 5 = ( b , 1 ) D ( R c ) * , where u i U ( R c 1 ) . Since d i e j for every i , j , ( R c ) contains K 4 , 5 , which again contradicts when using Lemma 5. Hence, | ξ 1 * | = 1 , which implies that R c 1 A 4 or A 2 [ x ] x 2 .
Now, suppose that | R c 2 | 4 with x , y , z R c 2 * and a ξ 1 * a 2 = 0 . Then, the set { ( 1 , 0 ) , ( u , 0 ) , ( 0 , x ) , ( 0 , y ) , ( 0 , z ) } { ( a , 0 ) , ( a , x ) , ( a , y ) , ( a , z ) } , where 1 u U ( R c 1 ) , induces a copy of K 4 , 5 in ( R c ) , which contradicts when using Lemma 5. Hence, | R c 2 | 3 . According to Theorem 2, | R c 2 | 2 . Hence, R c 2 A 3 .
Case 3.
Suppose that m = 1 . Then, ( R c ) is a complete graph in accordance with Theorem 1. Using Lemma 4, γ ¯ ( ( R c ) ) 2 , which contradicts.
Conversely, if R c K 4 × A 7 or A 5 × A 5 , then, according to ([10] Theorem 4.2), ( R c ) = ( R c ) . Hence, γ ¯ ( ( R c ) ) = 2 by ([25] Theorem 3.11), Also, if R c A 4 × A 3 or A 2 [ x ] x 2 × A 3 , then γ ¯ ( ( R c ) ) = 2 by Figure 1. □

5. Outerplanarity of ( R c )

If an embedding ϕ of a planar graph exhibits outerplanarity, meaning that every vertex in the embedding is connected to the outer face, it is designated as 1-outerplanar. This concept is expanded to identify an embedding as k-outerplanar if it is a ( k 1 ) -outerplanar embedding after eliminating all of the vertices on the outer face together with incident edges. If such a k-outerplanar embedding is possible on a graph, it is categorized as k-outerplanar. For a given graph G, the outerplanarity index is the lowest value of k for a G that is k-outerplanar. For a planar graph G, i ( G ) is known as the inner vertex number which is the lowest number of vertices in any plane embedding of G that are not part of the boundary of the exterior region. When i ( G ) = 1, graph G is considered minimally non-outerplanar. To gain a deeper understanding of k-outerplanarity, readers can refer to [26,27]. Establishing the findings given in this section is made possible from the Theorem given below:
Theorem 10
([16]). The graph G is outerplanar iff it contains no subgraph that is a subdivision of either K 4 or K 2 , 3 .
Theorem 11
([12], Theorem 2.6). Let R c be a finite commutative ring. Then, ( R c ) is outerplanar iff R c is equivalent to one of the rings listed below:
A 4 , A 2 [ x ] x 2 , A 9 , A 3 [ x ] x 2 , A 8 , A 2 [ x ] x 3 , A 4 [ x ] x 3 , x 2 2 , A 4 [ x ] 2 x , x 2 , A 2 [ x , y ] x 2 , x y , y 2 , K 4 [ x ] x 2 , A 4 [ x ] x 2 + x + 1 , A 2 × F , A 3 × A 3 ,
where F is a finite field.
Theorem 12.
Let R c is finite commutative ring. Then, ( R c ) has an outerplanarity index of 2 iff R c is equivalent to one of the rings listed below:
A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2   or   A 3 × K m ,   where   m 4 .
Proof. 
Suppose that ( R c ) has an outerplanarity index of 2, meaning ( R c ) is a planar graph. Using Theorem 2, ring R c can be determined to be isomorphic to one of the subsequent rings:
A 4 , A 2 [ x ] x 2 , A 9 , A 3 [ x ] x 2 , A 8 , A 2 [ x ] x 3 , A 4 [ x ] x 3 , x 2 2 , A 4 [ x ] 2 x , x 2 , A 2 [ x , y ] x 2 , x y , y 2 , K 4 [ x ] x 2 , A 4 [ x ] x 2 + x + 1 , A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , A 2 × K , or A 3 × K ,
where K is a finite field.
All that is left to do is determine whether or not these rings are minimal and 2-outerplanar. But, in the case of R c A 4 , A 2 [ x ] x 2 , A 9 , A 3 [ x ] x 2 , A 8 , A 2 [ x ] x 3 , A 4 [ x ] x 3 , x 2 2 , A 4 [ x ] 2 x , x 2 , A 2 [ x , y ] x 2 , x y , y 2 , K 4 [ x ] x 2 , A 4 [ x ] x 2 + x + 1 , A 2 × K or A 3 × A 3 , where K is a finite field, ( R c ) is a 1-outerplanar graph by Theorem 11. Since ( R c ) has an outerplanarity index of 2, R c A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , or A 3 × K m , where m 4 .
Conversely, if R c A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , or A 3 × K m , where m 4 , then ( R c ) contains K 4 or K 2 , 3 as subgraphs (Figure 2, Figure 3 and Figure 4). Thus, it is proved that ( R c ) is not 1-outerplanar, according to Theorem 10. The resulting graph is K 1 , K 2 , or fully disconnected after deleting vertices from the outside face; these three graphs are clearly 1-outerplanar (see Figure 2, Figure 3 and Figure 4). From the definition, we can infer that ( R c ) is 2-outerplanar for all rings, with 2 being the minimum. For this reason, ( R c ) has an outerplanarity index of 2. □
Corollary 1.
Consider R c as a finite commutative ring. Then, ( R c ) has an outerplanarity index of, at most, two.
Theorem 13.
Let R c be a finite commutative ring. Then, i ( G ) of ( R c ) is given by the following:
i ( ( R c ) ) = m 3 if R c A 3 × K m , m 6 ; 2 if R c A 4 × A 2 or A 2 [ x ] x 2 × A 2 or A 3 × K 5 ; 1 if R c A 25 or A 5 [ x ] x 2 or A 3 × K 4 ; 0 otherwise .
Proof. 
Using Theorem 11 and Figure 2, Figure 3 and Figure 4, the proof is completed. □
Corollary 2.
Consider R c as a finite commutative ring. Then, ( R c ) is minimally non-outerplanar iff R c A 3 × K 4 , A 25 , or A 5 [ x ] x 2 .

6. Book Thickness of ( R c )

In this section, we explore the book thickness of the graph ( R c ) with a genus of, at most, one. Initially, we calculate the book thickness of the planar ( R c ) associated with the rings described in Theorem 2 and demonstrate that the book thickness of all planar ( R c ) is bounded above by two.
An n-book embedding consists of a set of n half-planes called pages, with boundaries that are bound together along a single line called the spine. If the vertices of a graph can be embedded on the spine of a book, and the edges can be placed in r pages such that every edge lies in exactly one page, and no two edges cross within a given page, then the embedding is called an r-book embedding. The book thickness of a graph H, denoted by b t ( H ) , is the smallest integer n for which H has an n-book embedding. For details on the notion of embedding of graphs in a surface and book embedding, readers can refer to [17,28].
The results presented in [28] will assist us in proving the main results of this section.
Lemma 6
([28], Theorem 2.5). For a connected graph H, the following equivalences are valid:
  • H has a book thickness of zero iff it is a path.
  • H has a book thickness that is less than or equal to 1 iff it is outerplanar.
Lemma 7
([28], Theorems 3.4, 3.5, 3.6).
  • b t ( K p ) is given by p 2 , where p 3 .
  • b t ( K p , q ) = p , where p q with q p 2 p + 1 .
  • b t ( K 3 , 3 ) = 3 and b t ( K p , p ) = p 1 , where p 4 .
Theorem 14.
Let R c be an Artinian commutative ring for which ( R c ) is a planar graph. The following conditions must then be satisfied:
  • b t ( ( R c ) ) = 0 iff R c A 4 , A 2 [ x ] x 2 , A 9 , A 3 [ x ] x 2 , A 2 × A 2 , or A 2 × A 3 .
  • b t ( ( R c ) ) = 1 iff R c A 8 , A 2 [ x ] x 3 , A 4 [ x ] x 3 , x 2 2 , A 4 [ x ] 2 x , x 2 , A 2 [ x , y ] x 2 , x y , y 2 , K 4 [ x ] x 2 , A 4 [ x ] x 2 + x + 1 , A 2 × K m , where m 4 or A 3 × A 3 .
  • b t ( ( R c ) ) = 2 iff R c A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 or A 3 × K m , where m 4 .
Proof. 
The proof of parts (1) and (2) follows from Theorem 11 and Lemma 6.
For the proof of part (3), we have to discuss the following rings R c for which ( R c ) is planar but not an outerplanar graph:
A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , or A 3 × K m , where m 4
Since the graph ( R c ) for the above rings is not outerplanar, b t ( ( R c ) ) 2 .
If R c A 25 , A 5 [ x ] x 2 , then ( R c ) K 4 . Thus, by using Lemma 7(1), b t ( ( R c ) ) = 2 . If R c A 3 × K m , where m 4 , ( R c ) = ( R c ) by ([10], Theorem 4.2), then b t ( ( R c ) ) = 2 by using ([29], Theorem 6). If R c A 4 × A 2 , A 2 [ x ] x 2 × A 2 , then the 2-book embedding of ( R c ) is as shown in Figure 5. □
Theorem 15.
Let R c be a finite C R U . If λ ( ( R c ) ) = 1 , then the following holds:
  • b t ( ( R c ) ) = 3 iff R c A 49 , A 7 [ x ] x 2 , K 4 × K 4 , K 4 × A 5 , A 5 × A 5 , K 4 × A 7 or A 2 × A 2 × A 2 .
  • b t ( ( R c ) ) = 4 iff R c A 16 , A 2 [ x ] x 4 , A 4 [ x ] x 2 2 , x 4 , A 2 [ x ] x 3 2 , x 4 , A 4 [ x ] x 3 + x 2 2 , x 4 , A 2 [ x , y ] x 3 , x y , y 2 x 2 , A 2 [ x ] x 3 , x 2 2 x , A 8 [ x ] x 2 4 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 2 , y 3 , A 4 [ x ] x 2 , A 4 [ x , y ] x 2 , y 2 , x y 2 , A 2 [ x , y ] x 2 , y 2 , A 2 [ x , y ] x 2 , y 2 , x y , A 4 [ x ] x 3 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 , A 8 [ x ] x 2 , 2 x , K 8 [ x ] x 2 , A 4 [ x ] x 3 + x + 1 , A 4 [ x , y ] 2 x , 2 y , x 2 , y 2 , x y , A 2 [ x , y , z ] x , y , z 2 , A 4 × A 3 or A 2 [ x ] x 2 × A 3 .
Proof. 
Since λ ( ( R c ) ) = 1 , we have to consider the rings given in Theorems 3 and 4.
  • If R c A 49 , A 7 [ x ] x 2 , or A 2 × A 2 × A 2 , then ( R c ) = K 6 . Thus, by using Lemma 7(1), b t ( ( R c ) ) = 3 . If R c A 16 , A 2 [ x ] x 4 , A 4 [ x ] x 2 2 , x 4 , A 2 [ x ] x 3 2 , x 4 , A 4 [ x ] x 3 + x 2 2 , x 4 , A 2 [ x , y ] x 3 , x y , y 2 x 2 , A 2 [ x ] x 3 , x 2 2 x , A 8 [ x ] x 2 4 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 2 , y 3 , A 4 [ x ] x 2 , A 4 [ x , y ] x 2 , y 2 , x y 2 , A 2 [ x , y ] x 2 , y 2 , A 2 [ x , y ] x 2 , y 2 , x y , A 4 [ x ] x 3 , 2 x , A 4 [ x , y ] x 3 , x 2 2 , x y , y 2 , A 8 [ x ] x 2 , 2 x , K 8 [ x ] x 2 , A 4 [ x ] x 3 + x + 1 , A 4 [ x , y ] 2 x , 2 y , x 2 , y 2 , x y , or A 2 [ x , y , z ] x , y , z 2 , then ( R c ) = K 7 . Thus, b t ( Γ ( R c ) ) = 4 by using Lemma 7(1). If R c K 4 × K 4 , K 4 × A 5 , A 5 × A 5 or K 4 × A 7 , then ( R c ) = ( R c ) by using ([10], Theorem 4.2). Thus, by using ([29], Theorem 11), b t ( ( R c ) ) = 3 . If R c A 4 × A 3 or A 2 [ x ] x 2 × A 3 , then the 4-book embedding of ( R c ) is as shown in Figure 6. □

7. Conclusions

In conclusion, this paper successfully achieved a systematic classification of finite rings R c through the unique properties of their extended zero-divisor graphs ( R c ) . By focusing on cases when the extended zero-divisor graph has a genus or crosscap of two, we were able to elucidate several key characteristics of these rings.
Our findings can be summarized as follows:
  • For a finite commutative ring R c , the genus of the extended zero-divisor graph ( R c ) equals 2 iff R c is isomorphic to any one rings from the following: A 27 , A 9 [ x ] 3 x , x 2 3 , A 9 [ x ] 3 x , x 2 6 , A 3 [ x ] x 3 , A 3 [ x ] x , y 2 , A 9 [ x ] 3 , x 2 , K 9 [ x ] x 2 , A 9 [ x ] x 2 + 1 , K 4 × K 8 , K 4 × K 9 , K 4 × K 11 , or A 5 × A 7 .
  • The extended zero-divisor graph ( R c ) has a crosscap of 2 if and only if R c is isomorphic to K 4 × A 7 , A 5 × A 5 , A 4 × A 3 , or A 2 [ x ] x 2 × A 3 .
  • The outerplanarity index of ( R c ) is 2 if and only if R c is isomorphic to A 25 , A 5 [ x ] x 2 , A 4 × A 2 , A 2 [ x ] x 2 × A 2 , or A 3 × K m , where m 4 .
  • The i ( G ) , of i ( ( R c ) ) is
    i ( ( R c ) ) = 2 if R c A 4 × A 2 or A 2 [ x ] x 2 × A 2 ; m 3 if R c A 3 × K m , m 4 ; 1 if R c A 25 or A 5 [ x ] x 2 ; 0 otherwise .
These results offer a comprehensive understanding of the structural aspects of finite rings R c via the lens of their extended zero-divisor graphs. This classification not only enriches the theory of zero-divisor graphs but also opens new avenues for exploring the linkup with ring-theoretical properties and graph-theoretical characteristics.

Author Contributions

The idea of the present paper was proposed and improved by A.A.K. and M.A.A. All authors have read and agreed to the published version of the manuscript.

Funding

The authors extend their appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP2/339/45.

Data Availability Statement

No new data were created or analyzed in this 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. Alanazi, A.M.; Nazim, M.; Rehman, N.U. Classification of rings with toroidal and projective coannihilator graph. J. Math. 2021, 2021, 4384683. [Google Scholar] [CrossRef]
  4. Anderson, D.F.; Asir, T.; Badawi, A.; Tamizh, C.T. Graphs from Rings; Springer: Cham, Switzerland, 2021. [Google Scholar]
  5. Nazim, M.; Rehman, N.U. On the essential annihilating-ideal graph of commutative rings. Ars Math. Contemp. 2022, 22, 1–16. [Google Scholar]
  6. Nazim, M.; Rehman, N.U.; Mir, S.A. Some properties of the essential annihilating-ideal graph of commutative rings. Commun. Comb. Optim. 2023, 8, 715–724. [Google Scholar]
  7. Rehman, N.U.; Nazim, M.; Selvakumar, K. On the planarity, genus and crosscap of new extension of zero divisor graph of commutative rings. AKCE Int. J. Graphs Comb. 2022, 19, 61–68. [Google Scholar] [CrossRef]
  8. Rehman, N.U.; Nazim, M.; Mir, S.A. On the planarity, genus and crosscap of weakly zero divisor graph of commutative rings. Rev. Unión Matemática Argent. 2024, 67, 213–227. [Google Scholar] [CrossRef]
  9. Badawi, A. On the annihilator graph of a commutative ring. Commun. Algebra 2014, 42, 108–121. [Google Scholar] [CrossRef]
  10. Bakhtyiari, M.; Nikmehr, M.J.; Nikandish, R. The Extended zero divisor graph of a commutative Ring I. Hokkaido Math. J. 2017, 46, 381–393. [Google Scholar]
  11. Bakhtyiari, M.; Nikmehr, M.J.; Nikandish, R. The Extended zero divisor graph of a commutative Ring II. Hokkaido Math. J. 2017, 46, 395–406. [Google Scholar] [CrossRef]
  12. Rehman, N.U.; Nazim, M.; Selvakumar, K. On the genus of extended zero divisor graph of commutative rings. Rend. Circ. Mat. Palermo Ser. 2023, 72, 3541–3550. [Google Scholar] [CrossRef]
  13. Koam, N.A.; Ahmad, A.; Haider, A.; Ansari, M.A. Computation of eccentric topological indices of zero divisor graphs based on their edges. AIMS Math. 2022, 7, 11509–11518. [Google Scholar] [CrossRef]
  14. Nazim, M.; Mir, S.A.; Rehman, N.U. On the genus and crosscap two coannihilator graph of commutative rings. Comput. Appl. Math. 2024, 43, 350. [Google Scholar] [CrossRef]
  15. Atiyah, M.F.; Macdonald, I.G. Introduction to Commutative Algebra; Addison-Wesley Publishing Company: Boston, MA, USA, 1969. [Google Scholar]
  16. West, D.B. Introduction to Graph Theory, 2nd ed.; Prentice-Hall of India: New Delhi, India, 2002. [Google Scholar]
  17. White, A.T. Graphs, Groups and Surfaces; North-Holland: Amsterdam, The Netherlands, 1973. [Google Scholar]
  18. Wickham, C. Classification of rings with genus one zero divisor graphs. Comm. Algebra 2008, 36, 325–345. [Google Scholar] [CrossRef]
  19. Wang, H.J. Zero divisor graphs of genus one. J. Algebra 2006, 304, 666–678. [Google Scholar] [CrossRef]
  20. Smith, N.O. Planar zero divisor graphs. Int. J. Comm. Rings 2002, 2, 177–188. [Google Scholar]
  21. Ahmad, A.; Haider, A. Computing the radio labeling associated with zero divisor graph of a commutative ring. U.P.B. Sci. Bull. Ser. A. 2019, 81, 65–72. [Google Scholar]
  22. Koam, A.N.; Ahmad, A.; Haider, A. On Eccentric Topological Indices Based on Edges of zero divisor Graphs. Symmetry 2019, 11, 907. [Google Scholar] [CrossRef]
  23. Mohar, B.; Thomassen, C. Graphs on Surfaces; The Johns Hopkins University Press: Baltimore, MD, USA; London, UK, 1956. [Google Scholar]
  24. Asir, T.; Mano, K. Classification of non-local rings with genus two zero divisor graphs. Soft Comput. 2020, 24, 237–245. [Google Scholar] [CrossRef]
  25. Asir, T.; Mano, K. Classification of rings with crosscap two class of graphs. Discret. Appl. Math. 2019, 256, 13–21. [Google Scholar] [CrossRef]
  26. Frank, K. Determining the smallest k such that G is k-outerplanar. Lect. Notes Comput. Sci. 2007, 4698, 359–370. [Google Scholar]
  27. Kulli, V.R. On minimally nonouterplanar graphs. Proc. Indian Nat. Sci. Acad. 1975, 41, 275–280. [Google Scholar]
  28. Bernhart, R.F.; Kainen, C.P. The book thickness of a graph. J. Comb. Theory Ser. B 1979, 27, 320–331. [Google Scholar] [CrossRef]
  29. McKenzie, T.; Overbay, S. Book thickness of toroidal zero divisor graphs. Afr. Mat. 2017, 28, 823–830. [Google Scholar] [CrossRef]
Figure 1. The embedding of ( A 4 × A 3 ) ( A 2 [ x ] x 2 × A 3 ) on N 2 .
Figure 1. The embedding of ( A 4 × A 3 ) ( A 2 [ x ] x 2 × A 3 ) on N 2 .
Axioms 14 00170 g001
Figure 2. ( A 4 × A 2 ) ( A 2 [ x ] x 2 × A 2 ) .
Figure 2. ( A 4 × A 2 ) ( A 2 [ x ] x 2 × A 2 ) .
Axioms 14 00170 g002
Figure 3. ( A 3 × K m ) , m 4 .
Figure 3. ( A 3 × K m ) , m 4 .
Axioms 14 00170 g003
Figure 4. ( A 25 ) ( A 5 [ x ] x 2 ) .
Figure 4. ( A 25 ) ( A 5 [ x ] x 2 ) .
Axioms 14 00170 g004
Figure 5. Two-book embedding of ( A 4 × A 2 ) ( A 2 [ x ] x 2 × A 2 ) .
Figure 5. Two-book embedding of ( A 4 × A 2 ) ( A 2 [ x ] x 2 × A 2 ) .
Axioms 14 00170 g005
Figure 6. Four-book embedding of ( A 4 × A 3 ) ( A 2 [ x ] x 2 × A 3 ) .
Figure 6. Four-book embedding of ( A 4 × A 3 ) ( A 2 [ x ] x 2 × A 3 ) .
Axioms 14 00170 g006
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

Al Khabyah, A.; Ansari, M.A. Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings. Axioms 2025, 14, 170. https://doi.org/10.3390/axioms14030170

AMA Style

Al Khabyah A, Ansari MA. Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings. Axioms. 2025; 14(3):170. https://doi.org/10.3390/axioms14030170

Chicago/Turabian Style

Al Khabyah, Ali, and Moin A. Ansari. 2025. "Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings" Axioms 14, no. 3: 170. https://doi.org/10.3390/axioms14030170

APA Style

Al Khabyah, A., & Ansari, M. A. (2025). Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings. Axioms, 14(3), 170. https://doi.org/10.3390/axioms14030170

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