Next Article in Journal
Analysis of the Impact of Big Data and Artificial Intelligence Technology on Supply Chain Management
Previous Article in Journal
High-Field Nonresonant Response of Zundel Cations to Intense Terahertz Radiation
Previous Article in Special Issue
Upper Bounds of the Generalized Competition Indices of Symmetric Primitive Digraphs with d Loops
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Geodetic Number for the Unit Graphs Associated with Rings of Order P and P2

by
Heba Adel Abdelkarim
Department of Mathematics, Irbid National University, Irbid 21110, Jordan
Symmetry 2023, 15(9), 1799; https://doi.org/10.3390/sym15091799
Submission received: 19 August 2023 / Revised: 9 September 2023 / Accepted: 12 September 2023 / Published: 21 September 2023
(This article belongs to the Special Issue Graph Theory and Its Applications)

Abstract

:
Let G ( R ) be the unit graph associated with a ring R. Let p be a prime number and let R be a finite ring of order p or p 2 and be one of the rings Z p , Z p 2 , G F ( p 2 ) , Z p ( + ) Z p or Z p × Z p . We determine the geodetic number g ( G ( R ) ) associated with each such ring.
MSC:
16P10; 16U60; 11R04; 12E20; 05C25; 05C69; 05C90

1. Introduction

The study of graphs associated with the algebraic structure of a ring R has received attention from many researchers. These graphs are used to represent the abstract substructure of a ring R. Many researchers have studied the relations between properties of graphs associated with a ring R and the algebraic structure of R. Beck [1] presented the zero-divisor graph; a graph defined by the set of elements of a ring R such that any different vertices u and v are adjacent if u v = 0 . Anderson et al. [2] studied the zero-divisor graph Γ ( R ) of a commutative ring. They investigated the interaction between the ring’s theoretical properties of R and the graph’s theoretical properties of Γ ( R ) . Anderson and Badawi [3] introduced the total graph; a simple graph that is defined by the set of elements of a ring R in which any distinct vertices x and y are adjacent if their sum is a zero-divisor in R .
The unit graph that is associated with a ring R is denoted by G ( R ) ; it is a simple graph defined by a ring R in which two different vertices are adjacent if their sum is a unit in R. Grimaldi [4] studied the unit graph over Z n , analyzing the graph G ( Z n ) in terms of the covering number, the chromatic polynomial of the graph G ( Z n ) , the Hamilton cycles and independence number. Ashrafi et al. [5] investigated the unit graph G ( R ) for an associative ring R, where different characterization results were obtained regarding the diameter, girth, connectedness and chromatic index of G ( R ) . Furthermore, unit graphs of rings of polynomials and power series have been discussed in [6]. Further, there are several publications that are devoted to this topic (see [2,7,8]).
Harary et al. [9] presented the definition of the geodetic number as a new graph theoretical parameter. Let G = ( V , E ) be a connected graph. Let H V , such that for every v V , then two vertices x and y exist in H such that v lies on one of the geodesics x y . Then, H is called a geodetic set with cardinality greater than or equal to 2. Let H = { | H | : H be geodetic } . The geodetic number for a connected graph G is denoted by g ( G ) , where g ( G ) = min H .
Furthermore, Harary et al. [9] presented a formula expressing the geodetic number g ( G ) as a function of the number of vertices for some specific graphs. The geodetic number was determined for the complete graphs K n , the complete bipartite graphs K m , n with m , n 2 , the cycle graphs C n , the wheel graphs W 1 , n and the graph P r × P s , where P r , P s are path graphs. For a certain graph G, there are many applications of the geodetic number, including Location Theory and Convexity Theory, see [10].
The focus of our study is on calculating the geodetic number for the unit graph G ( R ) for the rings R of order p and p 2 . We hope this will open the way to further studies for more general rings. We note that for any connected graph G, the geodetic number g ( G ) 2 . In general, for any connected graph G, 2 g ( G ) n . In this paper, for a disconnected graph G, we consider g ( G ) to be . Furthermore, Chartrand et al. [11] showed that, for any connected graph G, g ( G ) n d i a m ( G ) + 1 , where dim ( G ) = max { d ( u , v ) : u , v V } . Several researchers have studied this topic and presented some results [12,13,14,15,16,17,18].

2. Preliminaries

Suppose R is a finite ring of order n . Let n = i = 1 k p i α i , where p i are distinct primes. Then, the additive Abelian group of R is a direct product of an additive cyclic group C m = a ; m a = 0 , where m = p i e j such that j e j = α i i , i = 1 , k . Hence, up to isomorphism, the number of rings of order n depends on the way that the exponents of α i are represented. As usual, in a ring R , an element a is said to be a unit if it has a multiplicative inverse b in which a b = b a = 1 . The set U ( R ) will denote the set of all units in R.
Consider Z p , the ring of all integers modulo p . The set Z p × will denote Z p { 0 } . The ring Z p × Z p is the set of ordered two-tuples from Z p such that addition and multiplication are defined ( mod p ) component wise. The ring Z p ( + ) Z p is defined to be the set of ordered two-tuples from Z p with the operations:
( a , b ) + ( c , d ) = ( a + c ( mod p ) , b + d ( mod p ) ) ( a , b ) · ( c , d ) = ( a c ( mod p ) , a d + b c ( mod p ) ) .
The ring Z p ( + ) Z p is called the idealization of Z p as a Z p module, see [19]. Note that the previous rings Z p , Z p × Z p and Z p ( + ) Z p are commutative rings with unities 1 , ( 1 , 1 ) and ( 1 , 0 ) , respectively. Moreover, the set of units for R = Z p × Z p is U ( R ) = { ( x , y ) : x , y Z p × } . If R = Z p ( + ) Z p , then U ( R ) = { ( x , y ) : x Z p × } , where ( x , y ) 1 = ( x 1 , y x 2 ) . The ring G F ( p n ) will denote a finite field of order p n , a commutative ring with a unity in which all non-zero elements are a unit.
All graphs will be simple; they do not contain any loops or multiple edges. The null graph will be assumed to be a disconnected graph in which any two distinct vertices are non-adjacent. Let G = ( V , E ) be a graph and let u V . The set of neighbors of u , denoted by N G ( u ) , is defined to be the set of all vertices that are adjacent to u . If u and v are distinct vertices, the geodesic between u and v, denoted by u v , is the shortest path that connects u and v ; its length is denoted by d ( u , v ) . We denote by I [ u , v ] the set of all vertices in V that lies on some geodesic between u and v that includes u and v . Consider H to be a subset of V. Let I [ H ] = u , v H I [ u , v ] . Then, H will be called a geodetic set in G if I [ H ] = V . The geodetic number for a connected graph G is denoted by g ( G ) ; it is the minimum cardinality of geodetic sets in G .

3. The Unit Graph Associated with Rings of Order p

Suppose R is a finite ring of order p . Then, its additive Abelian group is the cyclic group C p = a : p a = 0 for some a R . Since the product of two elements x , y R is equal to n m a 2 C p , then R = a : a 2 = 0 or R = a : a 2 = a . Therefore, R C p ( 0 ) , the trivial ring in which the generator has a trivial square, or R Z p under the operations modulo p . If R = C p ( 0 ) , then G ( R ) is a null graph of order p , and hence g ( G ( R ) ) = . Assume R = Z p . If x + y = 0 ( mod p ) , then d ( x , y ) = 2 ; otherwise, d ( x , y ) = 1 . Mainly, for every prime p, x + y = 0 ( mod p ) if and only if y = p x x except for p = 2 . Hence, G ( R ) is a connected simple graph with 1 d ( x , y ) 2 .

The Geodetic Number for the Unit Graph G ( Z p )

In Theorem 1, we determine the geodetic number for the unit graph G ( Z p ) .
Theorem 1.
The geodetic number for the unit graph G ( Z p ) is equal to 2.
Proof. 
Let V be the vertex set of the graph G ( Z p ) with order p . If p = 2 , then | V | = 2 and hence g ( G ( Z p ) ) = 2 . Now, for p > 2 , choose a Z p × . Let H a = { a , p a } , where a Z p × . Then, for every x Z p H a , we have d ( x , a ) = d ( x , p a ) = 1 . Hence, I [ H a ] = V and so g ( G ( Z p ) ) = 2 .
For instance, consider the unit graph G ( Z 5 ) . Let u i = i i Z 5 . Then, by Figure 1, the sets H 1 = { u 1 , u 4 } and H 2 = { u 2 , u 3 } are geodetic sets, where I [ H j ] = V for each j = 1 , 2 . Thus, g ( G ( Z 5 ) ) = 2 .

4. The Unit Graph Associated with Rings of Order p2

Suppose R is a finite ring of order p 2 . Hence, its additive Abelian group is the cyclic group C p 2 = x : p 2 x = 0 or C p × C p = x , y : p x = p y = 0 .
In fact, Waterhouse in [20] classified the finite rings of order m with an additive cyclic group C m as described in Proposition 1.
Proposition 1.
(Waterhouse) If R is a finite ring with a cyclic additive group C m and A = { d : d divides m } , then R is isomorphic to only one of the rings:
R d = a ; m a = 0 , a 2 = d a ,
where a is an additive generator of C m .
Remark 1.
Up to isomorphism, we have in total three rings with an additive Abelian group C p 2 ; R = R 1 = r ; p 2 r = 0 , r 2 = r , R = R p = r ; p 2 r = 0 , r 2 = p r or R = R p 2 = r ; p 2 r = 0 , r 2 = 0 .
Now, assume R has an additive Abelian group C p × C p . Therefore, R = r , s : p r = p s = 0 such that for every x , y R , x y = a r 2 + b s 2 + c r s + d s r for some a , b , c and d in R .
Fine [21] has shown that, up to isomorphism, there are exactly eight rings with an additive Abelian group C p × C p . If the generators of R have a trivial square, i.e., r 2 = s 2 = 0 , then in order to achieve the associative property, we have r s = 0 . Thus, the multiplication is trivial and so R = ( C p × C p ) ( 0 ) . If R = r , s : p r = p s = 0 , r 2 = 0 , s 2 = s , r s = s r = 0 , then R is isomorphic to the ring Z p + C p ( 0 ) . If R = r , s : p r = p s = 0 , r 2 = 0 , s 2 = s , r s = s r = r , then R is isomorphic to the ring Z p ( + ) Z p , where r = ( 0 , 1 ) and s = ( 1 , 0 ) . Otherwise, assume that r 2 0 and s 2 0 . Then, R can be isomorphic to one of the following rings: Z p × Z p , G F ( p 2 ) , or it is one of the following rings:
  • R = a , b ; p a = p b = 0 , a 2 = a , b 2 = b , a b = a , b a = b .
  • R = a , b ; p a = p b = 0 , a 2 = a , b 2 = b , a b = b , b a = a .
  • R = a , b ; p a = p b = 0 , a 2 = b , a b = 0 .
The following remark draws from [21].
Remark 2.
If R is a ring of order p 2 and its additive Abelian group is C p × C p , then there are only eight rings up to isomorphism.
Obviously, for any ring R, the presence of a unity element is necessary for the connectedness of G ( R ) . Thus, it will inevitably affect the possibility of studying its geodetic number. This leads us to classify all the rings of order p 2 in terms of containing a unity element.
Remark 3.
Assume R is a finite ring of order p 2 . By Remarks 1 and 2, we have 11 types and so R is one of the following rings:
1. 
If R is any one of Z p 2 , Z p × Z p , Z p ( + ) Z p , then it has a unity of 1 , ( 1 , 1 ) or ( 1 , 0 ) , respectively. Furthermore, since G F ( p 2 ) is a field, it has a unity of 1.
2. 
If R = R p = a ; p 2 a = 0 , a 2 = p a , then for each x R , x a = ( k a ) a = k p a for some k Z p 2 . So, if x a = a , then p a = 0 , which contradicts the assumption that R has an order p 2 . Furthermore, if R = R p 2 , the multiplication is trivial. Hence, the rings R p and R p 2 do not contain a unity element.
3. 
If R = Z p + C p ( 0 ) , then ( a , b ) R , ( a , b ) ( 0 , 1 ) = ( 0 , 0 ) ( 0 , 1 ) . Hence, there is no 1 R . Similarly, if R = C p × C p ( 0 ) , it is clear that it does not have a unity element.
4. 
If R = a , b ; p a = p b = 0 , a 2 = a , b 2 = b , a b = a , b a = b , assume x = n a + m b R , in which x y = y x = y y R . Then, a = x a = n a + m b and b = x b = n a + m b and hence, a = b , a contradiction. Thus, R does not have a unity element in this case. Similarly, it can be shown that the ring R = a , b ; p a = p b = 0 , a 2 = a , b 2 = b , a b = b , b a = a does not have a unity element.
5. 
If R = a , b ; p a = p b = 0 , a 2 = b , a b = 0 , we have b a = a 3 = a b = 0 and b 2 = a 2 b = 0 . Thus, x b = ( n a + m b ) b = 0 b . Hence, there is no 1 R .
According to Remark 3, we only have to specify the geodetic number for the unit graphs associated with the rings G F ( p 2 ) , Z p 2 , Z p ( + ) Z p and Z p × Z p .

4.1. The Geodetic Number for the Unit Graphs Associated with the Rings G F ( p 2 ) and Z p 2

In this section, we study the unit graphs for the rings G F ( p 2 ) and Z p 2 . We determine the minimal cardinality for the geodetic sets in these graphs based on the study of the set of neighbors for each vertex depending on the algebraic properties of each ring.

4.1.1. The Unit Graph over the Ring G F ( p 2 )

In the following theorem, we determine the geodetic number for the unit graph over the finite field G F ( p 2 ) .
Theorem 2.
The geodetic number for the unit graph G ( G F ( p 2 ) ) is equal to 2.
Proof. 
It is well known that for any p prime, the field G F ( p 2 ) is isomorphic to the ring Z p [ x ] q ( x ) , where q ( x ) = a 0 + a 1 x + x 2 is an irreducible monic polynomial over Z p . Let V be the vertex set of G ( G F ( p 2 ) ) , then:
V = { a + b X : a , b Z p , X = x + q ( x ) , x 2 = a 0 a 1 x } .
Therefore, for any two different vertices u = a + b X and v = c + d X , we have u + v = 0 if and only if c = p a and d = p b . Let u = a + b X be a non-zero vertex in V , let v = ( p a ) + ( p b ) X V and let H = { u , v } . Then, H is geodetic set, where for every w H , we have d ( w , u ) = d ( w , v ) = 1 . Therefore, w I [ u , v ] = I [ H ] and so g ( G ( R ) ) = 2 .
As an example, consider the unit graph G F ( 9 ) . Since G F ( 9 ) is isomorphic to the ring Z 3 [ x ] x 2 + 1 , the vertex set is V = { 0 , 1 , 2 , X , 2 X , 1 + X , 1 + 2 X , 2 + X , 2 + 2 X } .
In Figure 2, assume u i = i , where i V . We describe the unit graph G ( G F ( 9 ) ) as an illustration of the geodetic sets for this graph with a minimal cardinality.

4.1.2. The Unit Graph over the Ring G ( Z p 2 )

We discuss the unit graph G ( Z p 2 ) and we determine the geodetic number g ( G ( Z p 2 ) ) for each prime p.
Remark 4.
If p = 2 , the subset H = { 0 , 2 } is a geodetic set in G ( Z p 2 ) , where I [ H ] = V ( G ( Z 4 ) ) . Hence, g ( G ( Z 4 ) ) = 2 .
In Theorem 3, we show that for p > 2 , g ( G ( Z p 2 ) ) is equal to 4 .
Theorem 3.
The geodetic number for the unit graph G ( Z p 2 ) , for p > 2 , is equal to 4 .
Proof. 
In Z p 2 , each element has the form i + j p , where 0 i , j p 1 . Hence, U ( Z p 2 ) = Z p 2 { j p : 0 j p 1 } with an order p 2 p . Thus, i , j Z p , the set of neighbors N G ( Z p 2 ) ( i + j p ) = Z p 2 { ( p i ) + k p : 0 k p 1 } . The vertex set of G ( Z p 2 ) can be decomposed as a union of the classes A i = { i + j p : 0 j p 1 } , 0 i p 1 . Now, for any two distinct vertices u and v in V ( G ( Z p 2 ) ) , we have d ( u , v ) = 1 if v N G ( Z p 2 ) ( u ) . If u = i 0 + j 0 p and v = ( p i 0 ) + j 0 p for some i 0 , j 0 Z p , then d ( u , v ) = 2 , where x = i 1 + j 0 p for some i 1 Z p { i 0 , p i 0 } . Then, u x v is a path of length 2. Hence, G ( Z p 2 ) is a connected graph with 1 d ( u , v ) 2 .
Now, let H V ( G ( Z p 2 ) ) be a geodetic set in G ( Z p 2 ) . Let a , b H , in which d ( a , b ) > 1 . Then, a , b A 0 or a A i and b A p i for some i Z p and i 0 . Assume that a , b H A 0 . Then, a = c p and b = d p for some c , d Z p and hence, for all x V A 0 , P ( a , b ) : a = c p x b = d p is a path of length 2 and exists in G ( Z p 2 ) . Hence, { a , b } { A 1 , A 2 , , A p 1 } I [ a , b ] but A 0 I [ a , b ] . Since H is geodetic, it must have another two elements r A i and s A p i for some i = 1 , , p 1 and therefore, its cardinality is greater than or equal to 4 .
Now, suppose that a A i H , b A p i H for some i 0 . So, a = i + k p and b = ( p i ) + t p for some k , t Z p . Hence, for all x j i , j p i A j , we have:
P ( a , b ) : a = i + k p x b = ( p i ) + t p
as the shortest path from a to b including x . Thus, for j i and j p i , j A j { a , b } I [ a , b ] with A i A p i I [ a , b ] . Thus, since H is a geodetic set, H must contain two more elements r and s in which r , s A 0 or r A j and s A p j for some j i . According to the discussion above, we conclude that H will be a geodetic set if and only if it has at least four elements.
On the other hand, consider H 0 = { 0 , p , 1 , p 1 } . We can easily verify that I [ H 0 ] = V ( G ( Z p 2 ) ) . Thus, H 0 is a geodetic set and therefore, g ( G ( Z p 2 ) ) = 4 .

4.2. The Geodetic Number for the Unit Graphs Associated with the Rings Z p ( + ) Z p and Z p × Z p

Let G ^ be the unit graph associated with the ring Z p ( + ) Z p . Let U ^ be the unit graph associated with the ring Z p × Z p . We determine the geodetic numbers g ( G ^ ) and g ( U ^ ) .

4.2.1. The Geodetic Number for the Unit Graph G ^

We discuss the unit graph G ^ . Note that any two distinct vertices ( a , b ) and ( c , d ) in G ^ are adjacent if a + c is a unit in Z p .
Remark 5.
If p = 2 , the set H = { ( 0 , 1 ) , ( 0 , 0 ) } is geodetic in G ^ and hence, g ( G ^ ) = 2 for p = 2 .
Next, in Theorem 4, we determine g ( G ^ ) for p > 2 .
Theorem 4.
For p > 2 , the geodetic number for the unit graph G ^ is equal to 4 .
Proof. 
The vertex set of G ^ is V ( G ^ ) = { ( a , b ) : a , b Z p } , which has an order p 2 . Thus, for every ( a , b ) V ( G ^ ) , the set of neighbors for ( a , b ) is N G ^ ( ( a , b ) ) = { ( c , d ) : c Z p { p a } , d Z p } . Suppose u = ( i , k ) and v = ( j , l ) are distinct vertices in V ( G ^ ) . If j p i , then d ( u , v ) = 1 . Otherwise, assume that i + j = 0 ( mod p ) . Now, if i , j are non-zeros, then u = ( i , k ) ( 0 , k ) ( j , l ) = v is a path in G ^ and so d ( u , v ) = 2 . If i = j = 0 , since u and v are distinct in V ( G ^ ) , say k 0 . Thus, u = ( 0 , k ) ( k , l ) ( 0 , l ) = v is a path in G ^ and so d ( u , v ) = 2 . Thus, u , v V ( G ^ ) , we have 1 d ( u , v ) 2 and hence G ^ is connected.
Now, let H V ( G ^ ) be a geodetic set. Consider the set A i V ( G ^ ) such that A i = { ( i , j ) : 0 j p 1 } , 0 i p 1 . Then, V ( G ^ ) is the disjoint union of A i with a cardinality p for each i . Let a = ( i , k ) , b = ( j , l ) belong to H such that d ( a , b ) > 1 . If a , b H A 0 , then d ( a , b ) = 2 and therefore, for all x A i , if i 0 , a path a x b exists in G ^ . Thus, { A i : i 0 } { a , b } I [ a , b ] but A 0 I [ a , b ] . Note that for every w H ( A 0 A j ) { a , b } with j 0 , then A 0 I [ w , a ] I [ w , b ] I [ a , b ] . Thus, H must have at least two other vertices in addition to a and b for H to be geodetic.
In the same manner, assume that a , b H such that a H A i and b H A p i for some i 0 . Then, A i A p i I [ a , b ] . Furthermore, for every w ( A 0 A j ) { a , b } and j 0 , if w is added to H , the situation will remain the same. Thus, H must contain at least two other vertices c and d from A j and A p j , respectively, for some j i and j 0 . Therefore, the cardinality of H is greater than 4 .
Consider H 0 = { a , b , c , d } V ( G ^ ) such that a A i , b A p i , c A j , d A p j for some i , j Z p and i j . Then, I [ H 0 ] = V ( G ^ ) and hence, g ( G ^ ) = 4 .

4.2.2. The Geodetic Number for the Unit Graph U ^

Consider the unit graph U ^ . Let V ( U ^ ) = { ( a , b ) : a , b Z p } be the set of vertices of order p 2 . Thus, for each ( a , b ) V ( U ^ ) , the set of neighbors is defined by:
N U ^ ( ( a , b ) ) = { ( c , d ) : c Z p { p a } , d Z p { p b } } .
In particular, if p = 2 , the unit graph U ^ = G ( Z 2 × Z 2 ) is disconnected. For instance, d ( ( 0 , 0 ) , ( 1 , 0 ) ) = and hence, g ( U ^ ) = .
Lemma 1.
Consider U ^ provided that p 3 . Then, U ^ is connected, and for each two distinct vertices u and v in V ( U ^ ) , we have 1 d ( u , v ) 2 .
Proof. 
Let u and v be distinct in V ( U ^ ) , in which d ( u , v ) 1 . Assume that u = ( x , y ) and v = ( p x , t ) for some x , y , t Z p . Hence, we have to show that a ( u v ) geodesic exists in U ^ with a length equal to 2.
Suppose x = 0 . Since u and v are distinct, we have to consider y or t to be non-zero, say y > 0 . Then, P : ( 0 , y ) ( y , y ) ( 0 , t ) is a u v geodesic provided that t y . Otherwise, if t = y , then P : ( 0 , y ) ( y , 0 ) ( 0 , y ) is a u v geodesic. Furthermore, if x = y = 0 , let l { 0 , t } . Then, P : ( 0 , 0 ) ( l , t ) ( 0 , t ) is a u v geodesic.
Now, suppose that x 0 . Then, according to t, we have the following cases:
  • Suppose t = p y . Then, u = ( x , y ) and v = ( p x , p y ) . If y 0 , consider the u v geodesic P : ( x , y ) ( 0 , 0 ) ( p x , p y ) . If y = 0 , consider the ( u v ) geodesic P : ( x , 0 ) ( 0 , p x ) ( p x , 0 ) .
  • Suppose t p y . If t 0 , consider the u v geodesic P : ( x , y ) ( 0 , t ) ( p x , t ) . If t = 0 , then u = ( x , y ) and v = ( p x , 0 ) and so y 0 . Thus, we consider P : ( x , y ) ( 0 , y ) ( p x , 0 ) as the ( u v ) geodesic.
Lemma 2.
The geodetic number for the unit graph U ^ is greater than 2 .
Proof. 
Assume H is a geodetic set in V ( U ^ ) . Let u , v H such that d ( u , v ) 1 . Thus, u = ( a , b ) for some a , b Z p and v { ( p a , j ) , ( i , p b ) : i , j Z p } . Assume that v = ( p a , j 0 ) for some j 0 Z p . Let A V ( U ^ ) such that:
B = { ( a , k ) , ( p a , e ) , ( t , p b ) , ( r , p j 0 ) : k b , e j 0 } .
Then, B and B I [ u , v ] . For instance, if u = ( a , b ) and v = ( p a , j 0 ) with a 0 and j 0 b , then ( a , j 0 ) A but ( a , j 0 ) I [ u , v ] . If a 0 and j 0 = b , then u = ( a , b ) and v = ( p a , b ) and hence, ( 0 , p b ) B but ( 0 , p b ) I [ u , v ] . If a = 0 , then u = ( 0 , b ) and v = ( 0 , j 0 ) with j 0 b . Hence, we may assume that b 0 and so, ( b , p b ) B with ( b , p b ) I [ u , v ] .
Similarly, if u = ( a , b ) and v = ( i 0 , p b ) for some i 0 Z p , we have:
D = { ( p a , e ) , ( t , p b ) , ( p i 0 , k ) , ( r , b ) : t i 0 , r a }
as a non-empty set with D I [ u , v ] . Therefore, for any geodetic set in U ^ , the cardinality must be greater than 2 and hence, g ( U ^ ) 2 as required. □
Remark 6.
If p = 3 , it is immediately clear that H = { ( 0 , 1 ) , ( 0 , 2 ) , ( 0 , 3 ) } is a geodetic set in U ^ , where I [ H ] = V ( U ^ ) . Therefore, for U ^ = G ( Z 3 × Z 3 ) , g ( U ^ ) = 3 .
Next, we consider the unit graph U ^ for p 5 .
Lemma 3.
For p 5 , the geodetic number for U ^ is greater than 3 .
Proof. 
Let H be a geodetic set in V ( U ^ ) . In Lemma 2, we have proven that the cardinality of H is greater than 2 . Now, let u and v be distinct vertices in H, in which d ( u , v ) > 1 . Then, u = ( a , b ) and v { ( p a , j ) , ( i , p b ) : i , j Z p } for some a , b Z p . Now, assume that v = ( p a , j 0 ) for some j 0 Z p . Furthermore, let W = { ( a , k ) , ( p a , e ) , ( t , p b ) , ( r , p j 0 ) } V ( U ^ ) { u , v } . Then, W I [ u , v ] . Since we have shown that g ( U ^ ) > 2 for p 5 , it is sufficient to show that u , v , w is distinct in V ( U ^ ) , and the set { u , v , w } is not geodetic.
  • Suppose that w = ( a , k 0 ) H A , where k 0 b . Thus, u = ( a , b ) , v = ( p a , j 0 ) and w = ( a , k 0 ) with d ( u , v ) = d ( w , v ) = 2 and
    d ( w , u ) = 2 , if k 0 = p b or a = 0 1 , if k 0 p b and a 0 .
    If d ( w , u ) = 1 and j 0 = b , then u = ( a , b ) , v = ( p a , b ) and w = ( a , k 0 ) and so, ( p a , k 0 ) I [ u , v ] I [ w , v ] I [ u , w ] . If j 0 b , then ( p a , b ) I [ u , v ] I [ w , v ] I [ u , w ] .
    Now, assume that d ( w , u ) = 2 . Then, we have the following cases:
    Case 1: If a = 0 , then, u = ( 0 , b ) , v = ( 0 , j 0 ) and w = ( 0 , k 0 ) . Let t 0 Z p , in which t 0 { b , j 0 , k 0 } . Then, ( 0 , t 0 ) I [ w , v ] I [ u , v ] I [ w , u ] .
    Case 2: If k 0 = p b and a 0 , let t 0 Z p such that t 0 j 0 . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( a , p b ) and therefore, ( p a , t 0 ) I [ w , v ] I [ u , v ] I [ w , u ] .
  • Suppose that w = ( p a , e 0 ) H A for some e 0 j 0 . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( p a , e 0 ) with d ( u , v ) = d ( u , w ) = 2 and
    d ( v , w ) = 1 , if e 0 p j 0 and a 0 2 , if e 0 = p j 0 or a = 0 .
    If d ( v , w ) = 1 and j 0 = b , then u = ( a , b ) , v = ( p a , b ) and w = ( p a , e 0 ) with a 0 and e 0 j 0 = b by assumption. Therefore,
    ( a , e 0 ) I [ u , v ] I [ u , w ] I [ v , w ] ,
    while, if j 0 b , then ( a , j 0 ) I [ u , v ] I [ u , w ] I [ v , w ] .
    Now, assume that d ( v , w ) = 2 with a = 0 . Then, u = ( 0 , b ) , v = ( 0 , j 0 ) and w = ( 0 , e 0 ) and so, ( 0 , t 0 ) I [ w , v ] I [ u , v ] I [ w , u ] for some t 0 Z p { b , j 0 , e 0 } . Then, ( 0 , t 0 ) I [ w , v ] I [ u , v ] I [ w , u ] . If d ( v , w ) = 2 with e 0 = p j 0 and a 0 , let t 0 Z p { j 0 , b } . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( p a , p j 0 ) and therefore, ( a , t 0 ) I [ w , v ] I [ u , v ] I [ w , u ] .
  • Suppose that w = ( t 0 , p b ) H A for some t 0 Z p . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( t 0 , p b ) with d ( u , v ) = d ( u , w ) = 2 and,
    d ( w , v ) = 1 , if t 0 a and j 0 b 2 , if t 0 = a or j 0 = b .
    Assume that d ( w , v ) = 1 with a 0 . Since t 0 a , then ( a , x ) I [ u , v ] I [ u , w ] I [ v , w ] x Z p { b } . If a = 0 , then u = ( 0 , b ) , v = ( 0 , j 0 ) and w = ( t 0 , p b ) with 0 t 0 a and hence, ( p t 0 , p j 0 ) I [ u , v ] I [ u , w ] I [ v , w ] .
    If d ( w , u ) = 2 , assume that u = ( a , b ) , v = ( p a , j 0 ) and w = ( a , p b ) . Then, ( a , t ) I [ u , v ] I [ u , w ] I [ v , w ] for all t Z p { b , j 0 , p b } . Otherwise, assume that u = ( a , b ) , v = ( p a , b ) and w = ( t 0 , p b ) . In this case, we have ( a , t ) I [ u , v ] I [ u , w ] I [ v , w ] for some t { b , p b } .
  • Suppose that w = ( r , p j 0 ) H A for some r Z p . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( r , p j 0 ) with d ( u , v ) = d ( w , v ) = 2 and,
    d ( w , u ) = 1 , if r p a and j 0 b 2 , if r = p a or j 0 = b .
    Assume that d ( w , u ) = 1 . Then, u = ( a , b ) , v = ( p a , j 0 ) and w = ( r , p j 0 ) with r p a and j 0 b . If a 0 and j 0 > 0 , then ( p a , p j 0 ) I [ u , v ] I [ u , w ] I [ v , w ] . If a = 0 , then u = ( 0 , b ) , v = ( 0 , j 0 ) and w = ( r , p j 0 ) and therefore, ( t , p j 0 ) I [ u , v ] I [ u , w ] I [ v , w ] for all t Z p × { r } . If j 0 = 0 , then u = ( a , b ) , v = ( p a , 0 ) and w = ( r , 0 ) and therefore, ( a , t ) I [ u , v ] I [ u , w ] I [ v , w ] t Z p × { b } .
    If d ( w , u ) = 2 , then u = ( a , b ) , v = ( p a , b ) and w = ( p a , p b ) or w = ( r 0 , p b ) for some r 0 Z p . Then, a 0 and therefore, ( a , t ) I [ u , v ] I [ u , w ] I [ v , w ] for all t Z p { b } .
According to the cases above, the set { u , v , w } is not geodetic for all w A . Hence, g ( U ^ ) > 3 as required. □
In the next theorem, we determine the geodetic number for the unit graph U ^ for every odd prime p 5 .
Theorem 5.
The geodetic number for the unit graph U ^ for a prime number p , p 5 , is equal to 4 .
Proof. 
Let V ( U ^ ) = { ( a , b ) : a , b Z p } be the vertex set of the graph U ^ . Let a Z p { 0 } and let u 1 = ( a , a ) , u 2 = ( p a , p a ) , u 3 = ( a , p a ) and u 4 = ( p a , a ) be distinct vertices in V ( U ^ ) . We show that H = { u 1 , u 2 , u 3 , u 4 } is a geodetic set in V ( U ^ ) .
For every w V ( U ^ ) H , if w = ( i , j ) such that { i , j } { a , p a } = , then d ( w , u r ) = 1 for all 1 r 4 . Therefore, assume that { i , j } { a , p a } ϕ . This leads to one of the following cases:
  • Assume that w = ( p a , x ) for some x Z p . Since w H , we have x { a , p a } . Thus, w I [ u , v ] , where a path P ( u 2 , u 4 ) exists in U ^ and is defined by
    P ( u 2 , u 4 ) : u 2 = ( p a , p a ) w = ( p a , x ) u 4 = ( p a , a ) .
  • Assume that w = ( a , y ) V ( U ^ ) H for some y Z p . Then, y { a , p a } and hence w I [ u , v ] , where there is a path P ( u 1 , u 3 ) in U ^ defined by
    P ( u 1 , u 3 ) : u 1 = ( a , a ) w = ( a , y ) u 3 = ( a , p a )
  • Assume that w = ( t , p a ) V ( U ^ ) H for some t Z p . Then, t { a , p a } and hence w I [ u , v ] , where there is a path P ( u 2 , u 3 ) in U ^ :
    P ( u 2 , u 3 ) : u 2 = ( p a , p a ) w = ( t , p a ) u 3 = ( a , p a ) .
  • Assume that w = ( l , a ) V ( U ^ ) H for some l Z p . Then, l { a , p a } and hence w I [ u , v ] , where a path P ( u 1 , u 4 ) in U ^ is defined by
    P ( u 1 , u 4 ) : u 1 = ( a , a ) w = ( l , a ) u 4 = ( p a , a ) .
Thus, from the previous cases, we find that I [ H ] = V ( U ^ ) and so, H is geodetic. Thus, by Lemma 3, g ( U ^ ) = 4 .

5. Conclusions

In this paper, we have focused on studying the geodetic number for the unit graphs G ( R ) associated with rings of orders p and p 2 , where p is a prime number. It turned out that G ( R ) only exists if such rings have unity and hence are commutative. It was found that the geodetic number g ( G ( R ) ) is defined only if R is one of the following rings: Z p , Z p 2 , G F ( p 2 ) , Z p ( + ) Z p or Z p × Z p . For the remaining cases of rings of order p and p 2 , the unit graphs do not exist, since such rings lack unity elements. Furthermore, we have determined the geodetic number for the unit graphs associated with such rings based on the algebraic structure of each ring. This resulted in several conclusions. It was found that the geodetic number for each of the unit graphs G ( Z p ) and G ( G F ( p 2 ) ) is 2. For the unit graph G ( Z p 2 ) , it was shown that the geodetic number is 4 for p 3 , while g ( G ( Z p 2 ) ) = 2 for p = 2 . The unit graphs G ( Z p ( + ) Z p ) and G ( Z p × Z p ) are denoted by G ^ and U ^ , respectively. It was shown that the geodetic number g ( G ^ ) = 2 for p = 2 , while g ( G ^ ) = 4 for p > 2 . For the graph U ^ , it was found that g ( U ^ ) = for p = 2 and g ( U ^ ) = 3 for p = 3 , while g ( U ^ ) = 4 for p 5 . We have not discussed the geodetic number of rings of order p 3 and higher. Commutativity is not guaranteed in such rings. This makes the research more involved in this case.

Funding

This research is financially supported partially by Irbid National University, Irbid, Jordan.

Data Availability Statement

There is no data to be considered.

Conflicts of Interest

The author declares that there is no conflict of interest in this research.

References

  1. Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
  2. Anderson, D.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
  3. Anderson, D.F.; Badawi, A. The total graph of a commutative ring. J. Algebra 2008, 320, 2706–2719. [Google Scholar] [CrossRef]
  4. Grimaldi, R.P. Graphs from rings. In Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, USA, 20–24 February 1989; Taylor and Francis: Abingdon, UK, 1990; pp. 95–103. [Google Scholar]
  5. Ashrafi, N.; Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Unit graphs associated with rings. Commun. Algebra 2010, 38, 2851–2871. [Google Scholar] [CrossRef]
  6. Afkhami, M.; Khosh-Ahang, F. Unit graphs of rings of polynomials and power series. Arab. J. Math. 2013, 2, 233–246. [Google Scholar] [CrossRef]
  7. Anderson, D.D.; Naseer, M. Beck’s coloring of a commutative ring. J. Algebra 1993, 159, 500–514. [Google Scholar] [CrossRef]
  8. Su, H.; Zhou, Y. On the girth of the unit graph of a ring. J. Algebra Appl. 2014, 13, 1350082. [Google Scholar] [CrossRef]
  9. Harary, F.; Loikakis, E.; Tsouros, C. The geodetic number of a graph. Math. Comput. Model. 1993, 17, 89–95. [Google Scholar] [CrossRef]
  10. Harary, F.; Nieminen, J. Convexity in graphs. J. Differ. Geom. 1981, 16, 185–190. [Google Scholar] [CrossRef]
  11. Chartrand, G.; Harary, F.; Zhang, P. Geodetic sets in graphs. Discuss. Math. Graph Theory 2000, 20, 129–138. [Google Scholar] [CrossRef]
  12. Ahangar, H.A.; Samodivkin, V. The total geodetic number of a graph. Util. Math. 2016, 100, 253–268. [Google Scholar]
  13. Bermudo, S.; Rodriguez-Velazquez, J.A.; Sigarreta, J.M.; Yero, I. On geodetic and k-geodetic sets in graphs. Ars Comb. Waterloo Winn. 2010, 96, 469–478. [Google Scholar]
  14. Brešar, B.; Kovše, M.; Tepeh, A. Geodetic Sets in Graphs. Struct. Anal. Complex Netw. 2010, 20, 197–218. [Google Scholar]
  15. Dourado, M.C.; Protti, F.; Rautenbach, D.; Szwarcfiter, J. Some remarks on the geodetic number of agraph. Discret. Math. 2010, 310, 832–837. [Google Scholar] [CrossRef]
  16. Ekim, T.; Erey, A.; Heggernes, P.; Hof, P.; Meister, D. Computing minimum geodetic sets of proper interval graphs. Lect. Notes Comput. Sci. 2012, 7256, 279–290. [Google Scholar]
  17. Ge, H.; Wang, Z.; Zou, J. Strong geodetic number in some networks. J. Math. Res. 2019, 11, 20–29. [Google Scholar] [CrossRef]
  18. Gledel, V.; Irsic, V. Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes. Bull. Malays. Sci. Soc. 2019, 43, 2757–2767. [Google Scholar] [CrossRef]
  19. Anderson, D.D.; Winders, M. Idealization of a module. J. Commut. Algebra 2009, 1, 3–56. [Google Scholar] [CrossRef]
  20. Waterhouse, W.C. Rings with cyclic additive group. Am. Math. Mon. 1964, 71, 449–450. [Google Scholar]
  21. Fine, B. Classification of finite rings of order p2. Math. Mag. 1993, 66, 248–252. [Google Scholar] [CrossRef]
Figure 1. The unit graph G ( Z 5 ) .
Figure 1. The unit graph G ( Z 5 ) .
Symmetry 15 01799 g001
Figure 2. The unit graph G ( G F ( 9 ) ) .
Figure 2. The unit graph G ( G F ( 9 ) ) .
Symmetry 15 01799 g002
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

Abdelkarim, H.A. The Geodetic Number for the Unit Graphs Associated with Rings of Order P and P2. Symmetry 2023, 15, 1799. https://doi.org/10.3390/sym15091799

AMA Style

Abdelkarim HA. The Geodetic Number for the Unit Graphs Associated with Rings of Order P and P2. Symmetry. 2023; 15(9):1799. https://doi.org/10.3390/sym15091799

Chicago/Turabian Style

Abdelkarim, Heba Adel. 2023. "The Geodetic Number for the Unit Graphs Associated with Rings of Order P and P2" Symmetry 15, no. 9: 1799. https://doi.org/10.3390/sym15091799

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