Coloring of the annihilator graph of a commutative ring

2016 ◽  
Vol 15 (07) ◽  
pp. 1650124 ◽  
Author(s):  
R. Nikandish ◽  
M. J. Nikmehr ◽  
M. Bakhtyiari
Keyword(s):  
Commutative Ring ◽  
Explicit Formula ◽  
Chromatic Number ◽  
Clique Number ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph

Let [Formula: see text] be a commutative ring with identity, and let [Formula: see text] be the set of zero-divisors of [Formula: see text]. The annihilator graph of [Formula: see text] is defined as the graph AG[Formula: see text] with the vertex set [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if ann[Formula: see text]. In this paper, we study annihilator graphs of rings with equal clique number and chromatic number. For some classes of rings, we give an explicit formula for the clique number of annihilator graphs. Among other results, bipartite annihilator graphs of rings are characterized. Furthermore, some results on annihilator graphs with finite clique number are given.

On the essential graph of a commutative ring

2016 ◽  
Vol 16 (07) ◽  
pp. 1750132 ◽  
Author(s):  
M. J. Nikmehr ◽  
R. Nikandish ◽  
M. Bakhtyiari
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Zero Divisor ◽  
Artinian Ring ◽  
Clique Number ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Essential Ideal ◽  
Vertex Set

Let [Formula: see text] be a commutative ring with identity, and let [Formula: see text] be the set of zero-divisors of [Formula: see text]. The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if ann[Formula: see text] is an essential ideal. It is proved that [Formula: see text] is connected with diameter at most three and with girth at most four, if [Formula: see text] contains a cycle. Furthermore, rings with complete or star essential graphs are characterized. Also, we study the affinity between essential graph and zero-divisor graph that is associated with a ring. Finally, we show that the essential graph associated with an Artinian ring is weakly perfect, i.e. its vertex chromatic number equals its clique number.

The Weakly Nilpotent Graph of a Commutative Ring

2017 ◽  
Vol 60 (2) ◽  
pp. 319-328
Author(s):  
Soheila Khojasteh ◽  
Mohammad Javad Nikmehr
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Disjoint Union ◽  
Independence Number ◽  
Artinian Ring ◽  
Clique Number ◽  
Commutative Rings ◽  
Unicyclic Graph ◽  
Nilpotent Elements ◽  
Vertex Set

AbstractLet R be a commutative ring with non-zero identity. In this paper, we introduce theweakly nilpotent graph of a commutative ring. The weakly nilpotent graph of R denoted by Γw(R) is a graph with the vertex set R* and two vertices x and y are adjacent if and only if x y ∊ N(R)*, where R* = R \ {0} and N(R)* is the set of all non-zero nilpotent elements of R. In this article, we determine the diameter of weakly nilpotent graph of an Artinian ring. We prove that if Γw(R) is a forest, then Γw(R) is a union of a star and some isolated vertices. We study the clique number, the chromatic number, and the independence number of Γw(R). Among other results, we show that for an Artinian ring R, Γw(R) is not a disjoint union of cycles or a unicyclic graph. For Artinan rings, we determine diam . Finally, we characterize all commutative rings R for which is a cycle, where is the complement of the weakly nilpotent graph of R.

The Classification of the Annihilating-Ideal Graphs of Commutative Rings

2014 ◽  
Vol 21 (02) ◽  
pp. 249-256 ◽  
Author(s):  
G. Aalipour ◽  
S. Akbari ◽  
M. Behboodi ◽  
R. Nikandish ◽  
M. J. Nikmehr ◽  
...  
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Artinian Ring ◽  
Clique Number ◽  
Commutative Rings ◽  
Vertex Set

Let R be a commutative ring and 𝔸(R) be the set of ideals with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph 𝔸𝔾(R) with the vertex set 𝔸(R)* = 𝔸(R)\{(0)} and two distinct vertices I and J are adjacent if and only if IJ = (0). Here, we present some results on the clique number and the chromatic number of the annihilating-ideal graph of a commutative ring. It is shown that if R is an Artinian ring and ω (𝔸𝔾(R)) = 2, then R is Gorenstein. Also, we investigate commutative rings whose annihilating-ideal graphs are complete or bipartite.

A generalized ideal-based zero-divisor graph

2015 ◽  
Vol 14 (06) ◽  
pp. 1550079 ◽  
Author(s):  
M. J. Nikmehr ◽  
S. Khojasteh
Keyword(s):  
Prime Ideal ◽  
Commutative Ring ◽  
Chromatic Number ◽  
Zero Divisor ◽  
Undirected Graph ◽  
Clique Number ◽  
Proper Ideal ◽  
Graph Structure ◽  
Zero Divisor Graph ◽  
Vertex Set

Let R be a commutative ring with identity, I its proper ideal and M be a unitary R-module. In this paper, we introduce and study a kind of graph structure of an R-module M with respect to proper ideal I, denoted by ΓI(RM) or simply ΓI(M). It is the (undirected) graph with the vertex set M\{0} and two distinct vertices x and y are adjacent if and only if [x : M][y : M] ⊆ I. Clearly, the zero-divisor graph of R is a subgraph of Γ0(R); this is an important result on the definition. We prove that if ann R(M) ⊆ I and H is the subgraph of ΓI(M) induced by the set of all non-isolated vertices, then diam (H) ≤ 3 and gr (ΓI(M)) ∈ {3, 4, ∞}. Also, we prove that if Spec (R) and ω(Γ Nil (R)(M)) are finite, then χ(Γ Nil (R)(M)) ≤ ∣ Spec (R)∣ + ω(Γ Nil (R)(M)). Moreover, for a secondary R-module M and prime ideal P, we determine the chromatic number and the clique number of ΓP(M), where ann R(M) ⊆ P. Among other results, it is proved that for a semisimple R-module M with ann R(M) ⊆ I, ΓI(M) is a forest if and only if ΓI(M) is a union of isolated vertices or a star.

scholarly journals Thek-Zero-Divisor Hypergraph of a Commutative Ring

2007 ◽  
Vol 2007 ◽  
pp. 1-15 ◽  
Author(s):  
Ch. Eslahchi ◽  
A. M. Rahimi
Keyword(s):  
Commutative Ring ◽  
Nilpotent Element ◽  
Zero Divisor ◽  
Clique Number ◽  
Common Point ◽  
Prime Ideals ◽  
Uniform Hypergraph ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Vertex Set

The concept of the zero-divisor graph of a commutative ring has been studied by many authors, and thek-zero-divisor hypergraph of a commutative ring is a nice abstraction of this concept. Though some of the proofs in this paper are long and detailed, any reader familiar with zero-divisors will be able to read through the exposition and find many of the results quite interesting. LetRbe a commutative ring andkan integer strictly larger than2. Ak-uniform hypergraphHk(R)with the vertex setZ(R,k), the set of allk-zero-divisors inR, is associated toR, where eachk-subset ofZ(R,k)that satisfies thek-zero-divisor condition is an edge inHk(R). It is shown that ifRhas two prime idealsP1andP2with zero their only common point, thenHk(R)is a bipartite (2-colorable) hypergraph with partition setsP1−Z′andP2−Z′, whereZ′is the set of all zero divisors ofRwhich are notk-zero-divisors inR. IfRhas a nonzero nilpotent element, then a lower bound for the clique number ofH3(R)is found. Also, we have shown thatH3(R)is connected with diameter at most 4 wheneverx2≠0for all3-zero-divisorsxofR. Finally, it is shown that for any finite nonlocal ringR, the hypergraphH3(R)is complete if and only ifRis isomorphic toZ2×Z2×Z2.

scholarly journals On Graphs Related to Comaximal Ideals of a Commutative Ring

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Tongsuo Wu ◽  
Meng Ye ◽  
Dancheng Lu ◽  
Houyi Yu
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Clique Number ◽  
Induced Subgraph ◽  
The Core ◽  
Maximal Ideals ◽  
Graph Properties ◽  
Vertex Set

We study the co maximal graph Ω(R), the induced subgraph Γ(R) of Ω(R) whose vertex set is R∖(U(R)∪J(R)), and a retract Γr(R) of Γ(R), where R is a commutative ring. For a graph Γ(R) which contains a cycle, we show that the core of Γ(R) is a union of triangles and rectangles, while a vertex in Γ(R) is either an end vertex or a vertex in the core. For a nonlocal ring R, we prove that both the chromatic number and clique number of Γ(R) are identical with the number of maximal ideals of R. A graph Γr(R) is also introduced on the vertex set {Rx∣x∈R∖(U(R)∪J(R))}, and graph properties of Γr(R) are studied.

Crosscap two of class of graphs from commutative rings

2021 ◽  
Author(s):  
S. Karthik ◽  
S. N. Meera ◽  
K. Selvakumar
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Commutative Rings ◽  
Zero Divisors ◽  
Essential Ideal ◽  
Vertex Set ◽  
Annihilator Graph ◽  
Finite Commutative Rings

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be the set of all nonzero zero-divisors of [Formula: see text]. The annihilator graph of commutative ring [Formula: see text] is the simple undirected graph [Formula: see text] with vertices [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] is an essential ideal. In this paper, we classify all finite commutative rings with identity whose annihilator graph and essential graph have crosscap two.

The metric dimension of annihilator graphs of commutative rings

2019 ◽  
Vol 19 (05) ◽  
pp. 2050089
Author(s):  
V. Soleymanivarniab ◽  
A. Tehranian ◽  
R. Nikandish
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Commutative Rings ◽  
Metric Dimension ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph ◽  
Nonzero Identity

Let [Formula: see text] be a commutative ring with nonzero identity. The annihilator graph of [Formula: see text], denoted by [Formula: see text], is the (undirected) graph whose vertex set is the set of all nonzero zero-divisors of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we study the metric dimension of annihilator graphs associated with commutative rings and some metric dimension formulae for annihilator graphs are given.

scholarly journals When the annihilator graph of a commutative ring is planar or toroidal?

2020 ◽  
Vol 24 (2) ◽  
pp. 281-290
Author(s):  
Moharram Bakhtyiari ◽  
Reza Nikandish ◽  
Mohammad Javad Nikmehr
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph

Let R be a commutative ring with identity, and let Z(R) be the set of zero-divisors of R. The annihilator graph of R is defined as the undirected graph AG(R) with the vertex set Z(R)* = Z(R) \ {0}, and two distinct vertices x and y are adjacent if and only if  ann_R(xy) \neq ann_R(x) \cup ann_R(y). In this paper, all rings whose annihilator graphs can be embedded on the plane or torus are classified.

On perfect annihilator graphs of commutative rings

2020 ◽  
Vol 12 (05) ◽  
pp. 2050060
Author(s):  
Sh. Ebrahimi ◽  
A. Tehranian ◽  
R. Nikandish
Keyword(s):  
Commutative Ring ◽  
Commutative Rings ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph ◽  
Vast Range

Let [Formula: see text] be a commutative ring with identity, and let [Formula: see text] be the set of zero-divisors of [Formula: see text]. The annihilator graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we study the perfectness of annihilator graphs of a vast range of rings. Indeed, it is shown that if [Formula: see text] is reduced with finitely many minimal primes or nonreduced, then [Formula: see text] is perfect.

Sign in / Sign up

Export Citation Format

Share Document