<p>For a commutative ring <i>R</i> with identity, the zero-divisor graph of <i>R</i>, denoted <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1255_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, is the simple graph whose vertices are the nonzero zero-divisors of <i>R</i> where two distinct vertices <i>x</i> and <i>y</i> are adjacent if and only if <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1255_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="50" /> </InlineMediaObject> <EquationSource Format="TEX">\(xy=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mi>y</mi> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we are interested in partitioning the vertex set of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1255_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> into global defensive alliances for a finite commutative ring <i>R</i>. This problem has been well investigated in graph theory. Here we connected it with the ring theoretical context. We characterize various commutative finite rings for which the zero-divisor graph is partitionable into global defensive alliances. We also give several examples to illustrate the scopes and limits of our results.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Partitioning zero-divisor graphs of finite commutative rings into global defensive alliances

  • Driss Bennis,
  • Brahim El Alaoui

摘要

For a commutative ring R with identity, the zero-divisor graph of R, denoted \(\Gamma (R)\) Γ ( R ) , is the simple graph whose vertices are the nonzero zero-divisors of R where two distinct vertices x and y are adjacent if and only if \(xy=0\) x y = 0 . In this paper, we are interested in partitioning the vertex set of \(\Gamma (R)\) Γ ( R ) into global defensive alliances for a finite commutative ring R. This problem has been well investigated in graph theory. Here we connected it with the ring theoretical context. We characterize various commutative finite rings for which the zero-divisor graph is partitionable into global defensive alliances. We also give several examples to illustrate the scopes and limits of our results.