Abstract
Let 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 and be one of the rings or . We determine the geodetic number 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 [] 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 Anderson et al. [] studied the zero-divisor graph of a commutative ring. They investigated the interaction between the ring’s theoretical properties of R and the graph’s theoretical properties of Anderson and Badawi [] 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
The unit graph that is associated with a ring R is denoted by ; 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 [] studied the unit graph over analyzing the graph in terms of the covering number, the chromatic polynomial of the graph , the Hamilton cycles and independence number. Ashrafi et al. [] investigated the unit graph for an associative ring R, where different characterization results were obtained regarding the diameter, girth, connectedness and chromatic index of Furthermore, unit graphs of rings of polynomials and power series have been discussed in []. Further, there are several publications that are devoted to this topic (see [,,]).
Harary et al. [] presented the definition of the geodetic number as a new graph theoretical parameter. Let be a connected graph. Let , such that for every then two vertices x and y exist in H such that v lies on one of the geodesics Then, H is called a geodetic set with cardinality greater than or equal to 2. Let be geodetic The geodetic number for a connected graph G is denoted by where .
Furthermore, Harary et al. [] presented a formula expressing the geodetic number as a function of the number of vertices for some specific graphs. The geodetic number was determined for the complete graphs the complete bipartite graphs with the cycle graphs the wheel graphs and the graph , where are path graphs. For a certain graph G, there are many applications of the geodetic number, including Location Theory and Convexity Theory, see [].
The focus of our study is on calculating the geodetic number for the unit graph for the rings R of order p and . 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 . In general, for any connected graph G, In this paper, for a disconnected graph G, we consider to be Furthermore, Chartrand et al. [] showed that, for any connected graph G, , where Several researchers have studied this topic and presented some results [,,,,,,].
2. Preliminaries
Suppose R is a finite ring of order Let , where are distinct primes. Then, the additive Abelian group of R is a direct product of an additive cyclic group , where such that Hence, up to isomorphism, the number of rings of order n depends on the way that the exponents of are represented. As usual, in a ring an element a is said to be a unit if it has a multiplicative inverse b in which The set will denote the set of all units in R.
Consider the ring of all integers modulo The set will denote The ring is the set of ordered two-tuples from such that addition and multiplication are defined component wise. The ring is defined to be the set of ordered two-tuples from with the operations:
The ring is called the idealization of as a module, see []. Note that the previous rings and are commutative rings with unities and , respectively. Moreover, the set of units for is If then , where The ring will denote a finite field of order 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 be a graph and let The set of neighbors of denoted by is defined to be the set of all vertices that are adjacent to If u and v are distinct vertices, the geodesic between u and v, denoted by is the shortest path that connects u and its length is denoted by We denote by the set of all vertices in V that lies on some geodesic between u and v that includes u and Consider H to be a subset of V. Let . Then, H will be called a geodetic set in G if The geodetic number for a connected graph G is denoted by it is the minimum cardinality of geodetic sets in
3. The Unit Graph Associated with Rings of Order p
Suppose R is a finite ring of order Then, its additive Abelian group is the cyclic group for some Since the product of two elements is equal to then or Therefore, the trivial ring in which the generator has a trivial square, or under the operations modulo If then is a null graph of order and hence Assume If , then ; otherwise, . Mainly, for every prime p, if and only if except for Hence, is a connected simple graph with
The Geodetic Number for the Unit Graph
In Theorem 1, we determine the geodetic number for the unit graph .
Theorem 1.
The geodetic number for the unit graph is equal to 2.
Proof.
Let V be the vertex set of the graph with order If then and hence Now, for choose Let , where Then, for every we have Hence, and so □
For instance, consider the unit graph Let Then, by Figure 1, the sets and are geodetic sets, where for each Thus,
Figure 1.
The unit graph .
4. The Unit Graph Associated with Rings of Order p2
Suppose R is a finite ring of order Hence, its additive Abelian group is the cyclic group or
In fact, Waterhouse in [] classified the finite rings of order m with an additive cyclic group as described in Proposition 1.
Proposition 1.
(Waterhouse) If R is a finite ring with a cyclic additive group and divides then R is isomorphic to only one of the rings:
Remark 1.
Up to isomorphism, we have in total three rings with an additive Abelian group ; R , or
Now, assume R has an additive Abelian group Therefore, such that for every for some and d in
Fine [] has shown that, up to isomorphism, there are exactly eight rings with an additive Abelian group If the generators of R have a trivial square, i.e., then in order to achieve the associative property, we have . Thus, the multiplication is trivial and so . If then R is isomorphic to the ring If then R is isomorphic to the ring , where and Otherwise, assume that and Then, R can be isomorphic to one of the following rings: or it is one of the following rings:
The following remark draws from [].
Remark 2.
If R is a ring of order and its additive Abelian group is 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 . Thus, it will inevitably affect the possibility of studying its geodetic number. This leads us to classify all the rings of order in terms of containing a unity element.
Remark 3.
Assume R is a finite ring of order 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 , then it has a unity of or , respectively. Furthermore, since is a field, it has a unity of 1.
- 2.
- If , then for each for some . So, if , then , which contradicts the assumption that R has an order . Furthermore, if , the multiplication is trivial. Hence, the rings and do not contain a unity element.
- 3.
- If then Hence, there is no Similarly, if , it is clear that it does not have a unity element.
- 4.
- If , assume , in which . Then, and and hence, , a contradiction. Thus, R does not have a unity element in this case. Similarly, it can be shown that the ring does not have a unity element.
- 5.
- If , we have and . Thus, . Hence, there is no
According to Remark 3, we only have to specify the geodetic number for the unit graphs associated with the rings and
4.1. The Geodetic Number for the Unit Graphs Associated with the Rings and
In this section, we study the unit graphs for the rings and 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
In the following theorem, we determine the geodetic number for the unit graph over the finite field
Theorem 2.
The geodetic number for the unit graph is equal to 2.
Proof.
It is well known that for any p prime, the field is isomorphic to the ring , where is an irreducible monic polynomial over . Let V be the vertex set of then:
Therefore, for any two different vertices and we have if and only if and Let be a non-zero vertex in let and let Then, H is geodetic set, where for every we have Therefore, and so □
As an example, consider the unit graph Since is isomorphic to the ring , the vertex set is
In Figure 2, assume , where . We describe the unit graph as an illustration of the geodetic sets for this graph with a minimal cardinality.
Figure 2.
The unit graph .
4.1.2. The Unit Graph over the Ring
We discuss the unit graph and we determine the geodetic number for each prime p.
Remark 4.
If the subset is a geodetic set in , where . Hence,
In Theorem 3, we show that for is equal to
Theorem 3.
The geodetic number for the unit graph for is equal to
Proof.
In each element has the form where Hence, with an order Thus, the set of neighbors The vertex set of can be decomposed as a union of the classes Now, for any two distinct vertices u and v in , we have if If and for some then , where for some Then, is a path of length 2. Hence, is a connected graph with
Now, let be a geodetic set in Let , in which Then, or and for some and Assume that Then, and for some and hence, for all , is a path of length 2 and exists in Hence, but Since H is geodetic, it must have another two elements and for some and therefore, its cardinality is greater than or equal to
Now, suppose that for some So, and for some Hence, for all , we have:
as the shortest path from a to b including Thus, for and with Thus, since H is a geodetic set, H must contain two more elements r and s in which or and for some 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 We can easily verify that Thus, is a geodetic set and therefore, □
4.2. The Geodetic Number for the Unit Graphs Associated with the Rings and
Let be the unit graph associated with the ring Let be the unit graph associated with the ring We determine the geodetic numbers and
4.2.1. The Geodetic Number for the Unit Graph
We discuss the unit graph . Note that any two distinct vertices and in are adjacent if is a unit in
Remark 5.
If the set is geodetic in and hence, for
Next, in Theorem 4, we determine for
Theorem 4.
For the geodetic number for the unit graph is equal to
Proof.
The vertex set of is , which has an order Thus, for every the set of neighbors for is Suppose and are distinct vertices in If then Otherwise, assume that Now, if are non-zeros, then is a path in and so If since u and v are distinct in say Thus, is a path in and so Thus, we have and hence is connected.
Now, let be a geodetic set. Consider the set such that Then, is the disjoint union of with a cardinality p for each Let belong to H such that If then and therefore, for all if a path exists in . Thus, : but . Note that for every with then 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 such that and for some Then, Furthermore, for every and if w is added to the situation will remain the same. Thus, H must contain at least two other vertices c and d from and , respectively, for some and Therefore, the cardinality of H is greater than
Consider such that for some and . Then, and hence, □
4.2.2. The Geodetic Number for the Unit Graph
Consider the unit graph . Let be the set of vertices of order . Thus, for each , the set of neighbors is defined by:
In particular, if the unit graph is disconnected. For instance, and hence,
Lemma 1.
Consider provided that Then, is connected, and for each two distinct vertices u and v in we have .
Proof.
Let u and v be distinct in , in which Assume that and for some Hence, we have to show that a geodesic exists in with a length equal to 2.
Suppose Since u and v are distinct, we have to consider y or t to be non-zero, say Then, is a geodesic provided that Otherwise, if then is a geodesic. Furthermore, if let Then, is a geodesic.
Now, suppose that Then, according to t, we have the following cases:
- Suppose . Then, and If , consider the geodesic . If , consider the geodesic .
- Suppose . If , consider the geodesic . If , then and and so . Thus, we consider as the geodesic.
□
Lemma 2.
The geodetic number for the unit graph is greater than
Proof.
Assume H is a geodetic set in Let such that . Thus, for some and Assume that for some Let such that:
Then, and . For instance, if and with and then but If and , then and and hence, but If , then and with Hence, we may assume that and so, with
Similarly, if and for some , we have:
as a non-empty set with D. Therefore, for any geodetic set in , the cardinality must be greater than 2 and hence, as required. □
Remark 6.
If it is immediately clear that is a geodetic set in , where . Therefore, for .
Next, we consider the unit graph for
Lemma 3.
For the geodetic number for is greater than
Proof.
Let H be a geodetic set in . In Lemma 2, we have proven that the cardinality of H is greater than Now, let u and v be distinct vertices in H, in which Then, and for some Now, assume that for some . Furthermore, let Then, Since we have shown that for it is sufficient to show that is distinct in and the set is not geodetic.
- Suppose that , where Thus, and with andIf and then and and so, If thenNow, assume that Then, we have the following cases:Case 1: If then, and Let , in which . Then,Case 2: If and let such that Then, and and therefore,
- Suppose that for some Then, and with andIf and then and with and by assumption. Therefore,while, if thenNow, assume that with Then, and and so, for some . Then, If with and let Then, and and therefore,
- Suppose that for some Then, and with and,Assume that with Since then If then and with and hence, .If assume that and Then, for all . Otherwise, assume that and . In this case, we have for some
- Suppose that for some Then, and with and,Assume that Then, and with and If and then If then and and therefore, for all If then and and therefore,If then and or for some . Then, and therefore, for all
According to the cases above, the set is not geodetic for all . Hence, as required. □
In the next theorem, we determine the geodetic number for the unit graph for every odd prime
Theorem 5.
The geodetic number for the unit graph for a prime number is equal to
Proof.
Let be the vertex set of the graph . Let and let and be distinct vertices in We show that is a geodetic set in
For every if such that then for all Therefore, assume that This leads to one of the following cases:
- Assume that for some . Since we have Thus, , where a path exists in and is defined by
- Assume that for some . Then, and hence , where there is a path in defined by
- Assume that for some . Then, and hence , where there is a path in :
- Assume that for some . Then, and hence , where a path in is defined by
Thus, from the previous cases, we find that and so, H is geodetic. Thus, by Lemma 3, □
5. Conclusions
In this paper, we have focused on studying the geodetic number for the unit graphs associated with rings of orders p and where p is a prime number. It turned out that only exists if such rings have unity and hence are commutative. It was found that the geodetic number is defined only if R is one of the following rings: or For the remaining cases of rings of order p and 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 and is 2. For the unit graph it was shown that the geodetic number is 4 for , while for The unit graphs and are denoted by and , respectively. It was shown that the geodetic number for , while for For the graph it was found that for and for , while for We have not discussed the geodetic number of rings of order 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
- Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
- Anderson, D.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
- Anderson, D.F.; Badawi, A. The total graph of a commutative ring. J. Algebra 2008, 320, 2706–2719. [Google Scholar] [CrossRef]
- 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]
- Ashrafi, N.; Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Unit graphs associated with rings. Commun. Algebra 2010, 38, 2851–2871. [Google Scholar] [CrossRef]
- Afkhami, M.; Khosh-Ahang, F. Unit graphs of rings of polynomials and power series. Arab. J. Math. 2013, 2, 233–246. [Google Scholar] [CrossRef]
- Anderson, D.D.; Naseer, M. Beck’s coloring of a commutative ring. J. Algebra 1993, 159, 500–514. [Google Scholar] [CrossRef]
- Su, H.; Zhou, Y. On the girth of the unit graph of a ring. J. Algebra Appl. 2014, 13, 1350082. [Google Scholar] [CrossRef]
- Harary, F.; Loikakis, E.; Tsouros, C. The geodetic number of a graph. Math. Comput. Model. 1993, 17, 89–95. [Google Scholar] [CrossRef]
- Harary, F.; Nieminen, J. Convexity in graphs. J. Differ. Geom. 1981, 16, 185–190. [Google Scholar] [CrossRef]
- Chartrand, G.; Harary, F.; Zhang, P. Geodetic sets in graphs. Discuss. Math. Graph Theory 2000, 20, 129–138. [Google Scholar] [CrossRef]
- Ahangar, H.A.; Samodivkin, V. The total geodetic number of a graph. Util. Math. 2016, 100, 253–268. [Google Scholar]
- 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]
- Brešar, B.; Kovše, M.; Tepeh, A. Geodetic Sets in Graphs. Struct. Anal. Complex Netw. 2010, 20, 197–218. [Google Scholar]
- 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]
- 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]
- Ge, H.; Wang, Z.; Zou, J. Strong geodetic number in some networks. J. Math. Res. 2019, 11, 20–29. [Google Scholar] [CrossRef]
- 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]
- Anderson, D.D.; Winders, M. Idealization of a module. J. Commut. Algebra 2009, 1, 3–56. [Google Scholar] [CrossRef]
- Waterhouse, W.C. Rings with cyclic additive group. Am. Math. Mon. 1964, 71, 449–450. [Google Scholar]
- Fine, B. Classification of finite rings of order p2. Math. Mag. 1993, 66, 248–252. [Google Scholar] [CrossRef]
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. |
© 2023 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).