Abstract
Let be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset is a global offensive alliance if every vertex satisfies that . The global offensive alliance number is defined as the minimum cardinality among all global offensive alliances. Let R be a finite commutative ring with identity. In this paper, we study the global offensive alliance number of the zero-divisor graph .
1. Introduction
In this paper, denotes a simple connected graph of order and size m, where V is the vertex set and E the edge set. The subgraph induced by a set will be denoted by . For a vertex , the open neighborhood of v is defined as is adjacent to . The degree of the vertex , denoted by , is the cardinality of its open neighborhood. The minimum degree will be denoted by , and the maximum degree by . For a non-empty subset , and a vertex , the set of neighbors that v has in S is . The degree of the vertex v over S is defined as . The complement of any subset will be denoted with or simply when it is not necessary to specify V explicitly.
The mathematical properties of alliances in graphs were studied first by Kristiansen et al. [1]. They proposed different types of alliances, such as defensive alliances [2,3,4,5,6], offensive alliances [7,8,9] and dual alliances (also known as powerful alliances) [10].
Alliances in graphs serve as a mathematical model for several practical and theoretical problems that have been appearing in the literature of different areas of knowledge, such as data structure [11], web communities [12], bioinformatics (study of the proteome and genome) [13], as well as defense systems [14]. These types of alliances have been extensively studied in the last decade. In this paper, we are concerned with the study of a specific kind of alliance in a specific class of graphs, namely global offensive alliances on zero-divisor graphs.
The topic of global offensive alliances has been widely studied, for example, regarding the estimation of sharp bounds [7,8,15] and sharp bounds in planar graphs [16]. In [17], the authors consider sharp bounds for the global offensive alliance number of cubic graphs, their relationship with other graph-theoretic parameters such as the order, size and diameter [18] and the independence and domination numbers [19]. Offensive alliances have also been studied on graphs obtained as the result of an operation of graphs, e.g., the product of graphs [9].
Let S be a nonempty subset of the vertex set V, and S is a global offensive alliance of if it satisfies that
If, for a vertex , relation (1) is verified, we will say that v satisfies the global offensive alliance condition in S. The global offensive alliance number is defined as the minimum cardinality among all global offensive alliances. For convenience, we will call alliance a global offensive alliance of minimum cardinal.
In this work, R will denote a finite commutative ring with identity. The set of zero-divisors of R will be denoted by . The zero-divisor graph is the simple graph , with the proper zero-divisors of R as the vertex set, i.e., , and for different u, v , the vertices u and v are adjacent if and only if . Examples of zero-divisor graphs can be found in [20]. We will denote with the set of units of the ring R. If denotes the annihilator of v (that is, the set of elements such that ), notice that if or otherwise. The nilradical of the ring R is defined as for some . For more background on zero-divisor graphs, see [21].
I. Beck was the first to introduce the concept of a zero-divisor graph in 1988 for his study of the coloring of a commutative ring [22]. Beck considered all the elements of the ring as vertices of the graph, and an edge is obtained if two different elements u and v satisfy that . In 1999 [23], Anderson and Livingston introduced and studied the zero-divisor graph with a slight modification: the vertices of the graph are the proper zero-divisors.
Since then, the zero-divisor graph has become an important research topic, which is evidenced by the number of articles published on the subject. To cite a few examples, in [23], it is obtained that the diameter of is at most three and the girth is at most four. In [24], the authors study and characterize those rings R for which is a planar graph. In [25], Emad E. et. al. gave the dominance and independence number for for certain values of n. However, alliances had never been explored in this type of graph until recently, in 2020, when Muthana and Mamouni initiated the study of the global offensive alliance number in the zero-divisor graph [26]. The present work is motivated by the aforementioned study. Explicitly, we explore the global offensive alliance number in these graphs.
This paper is organized as follows: in Section 2.1, we give some results concerning the global offensive alliance number of the zero-divisor graph; for example, we give a characterization in terms of the global offensive alliance number for to be a complete graph. We also give sharp bounds of for different kinds of rings R (local, co-local and certain direct products of rings). Finally, in Section 2.2, we give a complete characterization of rings with or 2.
2. Results
2.1. The Global Offensive Alliance Number of the Zero-Divisor Graph
In this section, our main goal is to calculate or provide sharp bounds to the global offensive alliance number of zero-divisor graphs for some kind of direct products of finite local rings with finite fields—in particular, to characterize when the global offensive alliance number over the ring formed by the direct product of with any ring R is .
Recall that a commutative ring R is a local ring if it contains a unique maximal ideal M. Throughout this paper, we will use freely the well-known facts concerning this type of ring, listed in the following lemma (see [26]).
Lemma 1.
Let be a finite local ring that is not a field. Then, the following holds.
- (1) for some .
- (2) , and for some prime integer p, and some positive integers n and r.
Notice that if is a connected graph with more than one vertex, then, for each , the set is a global offensive alliance. Since is a connected graph [23] (Theorem 2.3), the following remark arises naturally.
Remark 1.
Let R be a ring with , then
Theorem 1.
If R is a local ring which is not a field, then
Proof.
Let ; if any alliance S contains some element with , then
In the other case, if, for some x with , it occurs that , then
hence,
consequently,
□
Notice that the inequality of the preceding theorem becomes an equality for some rings; for example, if , then ≅ and hence .
In [9] (Remark 2.1), it is shown that . If F and L are fields then (see [23], Example 3.4). Hence, the next lemma follows at once.
Lemma 2.
If F and L are fields, then
Proposition 1.
If R is a ring, then
- (i)
- The inequality holds.
- (ii)
- If R has at least two units, then is an element of every alliance of .
Proof.
- (i)
- We claim that the set is a global offensive alliance. Take ; if , then and (since is adjacent to ), while . On the other hand, if , then ; in this case, take such that . This shows that (since is adjacent to ), while .
- (ii)
- Let S be a global offensive alliance that does not contain the element . This implies that . In this way, is a global offensive alliance with vertices.
□
For an example of the above proposition, take R ≅ ; in this case, (see Figure 1).
Figure 1.
Diagram of the graph ).
Theorem 2.
If R is a ring, then if and only if and exactly one of the following conditions hold:
- (i) and , or
- (ii) .
Proof.
⇒) In [23], it can be found that all zero-divisor graphs with at most four vertices, an easy computation shows the result and this establishes (i).
For (ii), if by [23] (Theorem 2.8), R is a local ring such that, for each , .
Let S be a alliance of . If is such that , since the degree of this vertex in is , it must occur that . The other inequality is Proposition 1 (i).
Suppose now that, for all element , . Since , Lemma 1 shows that R contains at least two units. According to Proposition 1 (ii), it follows that ; hence, and again Proposition 1 (i) gives .
⇐) (i) If the zero-divisor graph has at most four vertices and , once again, an easy examination of all of these zero-divisor graphs shows that must be complete.
(ii) The set is a global offensive alliance of , which, by hypothesis, is in fact a alliance. For each , since is not a global offensive alliance and , it follows that .
The above has several implications: the nilradical of R (i.e., the ideal of all those nilpotent elements ) is equal to and therefore R is a local ring; each vertex of the form (and of the form ) with has degree at least 5 and the set is nonempty.
The theorem is proven if we can see that is empty. If this is not the case, there are different such that . If , it can be verified that is a global offensive alliance with n vertices, which is a contradiction. □
In Figure 2, we show an example of Theorem 2 where R ≅ and ≅ . It can be seen that the vertices in red form a global offensive alliance of minimal size.
Figure 2.
Diagram of the graph ).
Recall that a ring R is co-local if it contains a non-trivial ideal contained in each non-trivial proper ideal.
Theorem 3.
If a finite ring R is co-local, then it is local.
Proof.
If R is a field, the result is evident. If R is not a field, let N be the non-trivial ideal contained in each non-trivial proper ideal of R. Let be with , and then x is contained in every non-trivial ideal of R. In particular, for each , . Conversely, every is such that ; in other words, ; hence, R is local. □
Theorem 4.
Let R be a co-local ring that is not a field and N the non-trivial ideal contained in all proper non-trivial ideals of R. Then, . Furthermore, this bound is sharp.
Proof.
By Theorem 3, R is a local ring with unique maximal ideal . Moreover, and for some prime number p and for some positive integer number n and therefore , with . If , then , and, from this, it follows that . Now, if S is a alliance and some does not belong to S, then x is adjacent to at least vertices in S.
On the other hand, if , then .
Finally, if , then is a complete graph and it is well known that .
It can be verified that the bound is attained for . □
Theorem 5.
Let R be a ring and r the minimum number of nilpotent elements of index 2 contained in the complement of a alliance, then
Moreover, the bound is sharp.
Proof.
Let be a alliance of that satisfies the conditions of the statement and let be the nilpotent elements of index 2 contained in . Set and let us show that this set is a global offensive alliance of . To this end, first observe that the elements of satisfy the global offensive alliance condition. For an element , note that and ; therefore,
Moreover, since , we have
A similar analysis to the previous one shows that if , then .
The bound is attained for . □
Proposition 2.
Let R be a ring, then
- (1)
- ;
- (2)
- and if R is a reduced ring (i.e., a ring not containing non-zero elements x such that ).
Proof.
(1) Let be a dominating set; since is the unique neighbor of , it must be or . By cases.
Suppose and consider the projection to the second factor, and , then ; thus, is not a global offensive alliance of , which implies the existence of such that
thus,
so S is not a global offensive alliance of .
Now, if and , we may observe that ; then, ; thus, a contradiction.
Hence, .
For the second statement, observe that if is a minimal global offensive alliance, then
is a global offensive alliance in . Therefore,
□
Theorem 6.
If R is a ring such that is a complete graph and F a field with , then
Proof.
Consider the set
If , then , and the set is a alliance.
If , then R is a local ring in which for any .
If R is a field, , and, in this case, the result is simply Lemma 2.
In another case, the proof is completed using the following steps.
Step 1. Any vertex of must belong to each alliance.
Indeed, if is a global offensive alliance and for some , , then S must contain at least of the neighbors of , which are distributed among the sets , and .
If , then is a global offensive alliance containing fewer vertices than S does. Now, if , some vertex of not found in S and therefore it must be
Moreover, in order for the global offensive alliance condition to be satisfied at the vertex , the following inequality must also be satisfied:
Therefore, is a global offensive alliance and
Step 2. The inequality holds.
If and are subsets whose cardinal numbers are and , respectively, then the subsets , and are global offensive alliances, with what is certainly .
Finally, if S is a alliance of , by Step 1, we know that S has the form .
Now, if , , we have and . In order for the global offensive alliance condition to be met in these two vertices, the set S is required to contain at least vertices of and at least vertices of . In this way,
□
Figure 3.
Diagram of the graph ).
Theorem 7.
Let F and K be two fields with , then .
Proof.
Since , the vertex is in each alliance. In addition, if we consider the set
then there are global offensive alliances of cardinal for each . For example,
- (i)
- ,
- (ii)
- ,
- (iii)
- (with , ),
- (iv)
- (with , ),
hence,
.
Now, if S is a alliance and there are vertices , with and , then and we are done.
If y for some , then .Similarly, if and some . □
Figure 4.
Diagram of the graph ).
2.2. Rings with Small Global Offensive Alliance Number
Theorem 8.
Let R be a finite commutative ring, then if and only if R is isomorphic to any of the following rings , , , , , or , where F is a field.
Proof.
By [16] (Page 10), is a star graph. Now, if , then , , , , or (see [23], Example 2.1). If by [23] (Theorem 2.13) , with F a finite field.
The converse is straightforward. □
A graph is a 4-book if V is the union of subsets such that and
- there exists , a pair of distinct vertices such that if then ,
- for , there are no edges connecting vertices of with vertices of ,
- if , then it is adjacent to both and .
Each one of these r-induced subgraphs is called a 4-book page of the .
Proposition 3.
Let R be a finite commutative ring, then if and only if R is isomorphic to one of the following rings (where K is a field), , , , , , , , , , , , , , , , , .
Proof.
By [16], if and only if is a 4-book graph. However, such graphs are planar graphs; in [21] (Theorem 6.4), it is shown that there are only 44 types of rings whose zero-divisor graph is planar, of which the ones above are the only ones that meet the condition of being 4-book graphs. □
3. Conclusions
One of the main contributions of this work is to relate graph theory with commutative ring theory. In this paper, we propose the global offensive alliance number over the zero-divisor graph, which extends the study realized by Muthana and Mamouni in [26]. In the aforementioned work, the authors calculated the global defensive alliance number for some kinds of direct products of finite fields with finite local rings. In addition, they described a complete characterization of rings with , or 2. In our work, we obtain similar results corresponding to the context of the global offensive alliances (see Theorems 6–8 and Proposition 3).
As far as other work is concerned, in [9,13,17], the authors studied global offensive alliances over specific families of graphs, such as cubic, trees, and Cartesian product graphs. Our work develops this subject within the family of zero-divisor graphs. The work [23] gave a characterization of the rings R in order for to be a complete graph. In our work, Theorem 2 characterizes all those rings R with complete graph in terms of the global offensive alliance number.
We conclude this paper by pointing out that the topic can be extended to the study of other types of alliances (e.g., strong global offensive alliances).
Author Contributions
Writing—original draft, R.J.M., G.R.H., O.R.C. and J.R.V. The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
This research received funding from the UAGro (Universidad Autónoma de Guerrero) and the PRODEP (Programa para el Desarrollo Profesional Docente).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The authors would like to thank the editor and the anonymous referees, whose comments and suggestions greatly improved the presentation of this paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Kristiansen, P.; Hedetniemi, S.M.; Hedetniemi, S.T. Alliances in graphs. J. Comb. Math. Comb. Comput. 2004, 48, 157–177. [Google Scholar]
- Rodríguez-Velázquez, J.A.; Yero, I.G.; Sigarreta, J.M. Defensive k-alliances in graphs. Appl. Math. Lett. 2009, 22, 96–100. [Google Scholar] [CrossRef] [Green Version]
- Rodríguez-Velázquez, J.A.; Sigarreta, J.M. Global defensive k-alliances in graphs. Discret. Appl. Math. 2009, 157, 211–218. [Google Scholar] [CrossRef] [Green Version]
- Sigarreta, J.M.; Rodríguez-Velázquez, J.A. On defensive alliances and line graphs. Appl. Math. Lett. 2006, 19, 1345–1350. [Google Scholar] [CrossRef] [Green Version]
- Yero, I.G.; Rodríguez-Velázquez, J.A. Boundary defensive k-alliances in graphs. Discret. Appl. Math. 2010, 158, 1205–1211. [Google Scholar] [CrossRef] [Green Version]
- Yero, I.G.; Bermudo, S.; Rodríguez-Velázquez, J.A.; Sigarreta, J.M. Partitioning a graph into defensive k-alliances. Acta Math. Sin. Engl. Ser. 2010, 26, 73–82. [Google Scholar] [CrossRef] [Green Version]
- Favaron, O.; Fricke, G.; Goddard, W.; Hedetniemi, S.; Hedetniemi, S.; Kristiansen, P.; Skaggs, R. Offensive alliances in graphs. Discuss. Math. Graph Theory 2004, 24, 263–275. [Google Scholar] [CrossRef]
- Rad, N.J. A note on the global offensive alliances in graphs. Discret. Appl. Math. 2018, 250, 373–376. [Google Scholar] [CrossRef]
- Bermudo, S.; Rodríguez-Velázquez, J.A.; Sigarreta, J.M.; Yero, I.G. On global offensive k-alliances in graphs. Appl. Math. Lett. 2010, 23, 1454–1458. [Google Scholar] [CrossRef] [Green Version]
- Brigham, R.C.; Dutton, R.D.; Haynes, T.W.; Hedetniemi, S.T. Powerful alliances in graphs. Discret. Math. 2009, 309, 2140–2147. [Google Scholar] [CrossRef] [Green Version]
- Shafique, K.H. Partitioning a Graph in Alliances and Its Application to Data Clustering. Doctoral Dissertation, University of Central Florida, 4000 Central Florida Blvd, Orlando, FL, USA, 2004. [Google Scholar]
- Flake, G.W.; Lawrence, S.; Giles, C.L. Efficient identification of web communities. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, 20–23 August 2000; pp. 150–160. [Google Scholar]
- Haynes, T.; Knisley, D.; Seier, E.; Zou, Y. A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 2006, 7, 1–11. [Google Scholar] [CrossRef] [Green Version]
- Powel, M. Alliance in graph. In Proceedings of the 255th of the USA Military Academy, Army Research Laboratory, Aberdeen Proving Ground, Harford County, MD, USA, 2004; pp. 1350–1415. [Google Scholar]
- Fernau, H.; Rodríguez, J.A.; Sigarreta, J.M. Offensive r-alliances in graphs. Discret. Appl. Math. 2009, 157, 177–182. [Google Scholar] [CrossRef] [Green Version]
- Rodriguez-Velazquez, J.A.; Sigarreta, J.M. Global alliances in planar graphs. AKCE Int. J. Graphs Comb. 2007, 4, 83–98. [Google Scholar]
- Rodríquez-Velázquez, J.A.; Sigarreta, J.M. Offensive alliances in cubic graphs. Int. Math. Forum 2006, 1, 1773–1782. [Google Scholar]
- Sigarreta, J.M.; Rodríguez, J.A. On the global offensive alliance number of a graph. Discret. Appl. Math. 2009, 157, 219–226. [Google Scholar] [CrossRef] [Green Version]
- Rodríguez-Velázquez, J.A.; Sigarreta, J.M. Global offensive alliances in graphs. Electron. Notes Discret. Math. 2006, 25, 157–164. [Google Scholar] [CrossRef]
- Redmond, S.P. On zero-divisor graphs of small finite commutative rings. Discret. Math. 2007, 307, 1155–1166. [Google Scholar] [CrossRef] [Green Version]
- Anderson, D.F.; Axtell, M.C.; Stickles, J.A. Zero-divisor graphs in commutative rings. In Commutative Algebra; Springer: New York, NY, USA, 2011; pp. 23–45. [Google Scholar]
- Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
- Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef] [Green Version]
- Smith, N.O. Planar zero-divisor graphs. Int. J. Commut. Rings 2003, 2, 177–188. [Google Scholar]
- AbdAlJawad, E.E.; Al-Ezeh, H. Domination and Independence Numbers of Γ(Zn). Int. Math. Forum 2008, 11, 503–511. [Google Scholar]
- Muthana, N.; Mamouni, A. On defensive alliance in zero-divisor graphs. J. Algebra Its Appl. 2020, 20, 2150155. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. 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/).