scholarly journals Nonessential sum graph of an Artinian ring

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Bikash Barman ◽  
Kukil Kalpa Rajkhowa
Keyword(s):  
Design Methodology ◽  
Undirected Graph ◽  
Independence Number ◽  
Domination Number ◽  
Artinian Ring ◽  
Clique Number ◽  
Content Type ◽  
Cut Vertex ◽  
Vertex Set ◽  
Regular Character

PurposeThe authors study the interdisciplinary relation between graph and algebraic structure ring defining a new graph, namely “non-essential sum graph”. The nonessential sum graph, denoted by NES(R), of a commutative ring R with unity is an undirected graph whose vertex set is the collection of all nonessential ideals of R and any two vertices are adjacent if and only if their sum is also a nonessential ideal of R.Design/methodology/approachThe method is theoretical.FindingsThe authors obtain some properties of NES(R) related with connectedness, diameter, girth, completeness, cut vertex, r-partition and regular character. The clique number, independence number and domination number of NES(R) are also found.Originality/valueThe paper is original.

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 intersection graph of ideals of ℤm

2019 ◽  
Vol 11 (04) ◽  
pp. 1950037 ◽  
Author(s):  
S. Khojasteh
Keyword(s):  
Maximum Degree ◽  
Undirected Graph ◽  
Independence Number ◽  
Domination Number ◽  
Intersection Graph ◽  
Graph Structure ◽  
Chromatic Index ◽  
Vertex Set ◽  
Numerical Invariants ◽  
Positive Integers

Let [Formula: see text] be an integer, and let [Formula: see text] be the set of all non-zero proper ideals of [Formula: see text]. The intersection graph of ideals of [Formula: see text], denoted by [Formula: see text], is a graph with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if and only if [Formula: see text]. Let [Formula: see text] be an integer and [Formula: see text] be a [Formula: see text]-module. In this paper, we study a kind of graph structure of [Formula: see text], denoted by [Formula: see text]. It is the undirected graph 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]. Clearly, [Formula: see text]. Let [Formula: see text] and [Formula: see text], where [Formula: see text]’s are distinct primes, [Formula: see text]’s are positive integers, [Formula: see text]’s are non-negative integers, and [Formula: see text] for [Formula: see text] and let [Formula: see text], [Formula: see text]. The cardinality of [Formula: see text] is denoted by [Formula: see text]. Also, let [Formula: see text], [Formula: see text] and [Formula: see text] denote the independence number, the domination number and the set of all isolated vertices of [Formula: see text], respectively. We prove that [Formula: see text] and we show that if [Formula: see text] is not a null graph, then [Formula: see text] and [Formula: see text] We also compute some of its numerical invariants, namely maximum degree and chromatic index. Among other results, we determine all integer numbers [Formula: see text] and [Formula: see text] for which [Formula: see text] is Eulerian.

THE INTERSECTION GRAPH OF GAMMA SETS IN THE TOTAL GRAPH OF A COMMUTATIVE RING-II

2013 ◽  
Vol 12 (04) ◽  
pp. 1250199 ◽  
Author(s):  
T. ASIR ◽  
T. TAMIZH CHELVAM
Keyword(s):  
Commutative Ring ◽  
Independence Number ◽  
Clique Number ◽  
Commutative Rings ◽  
Intersection Graph ◽  
Vertex Connectivity ◽  
Total Graph ◽  
Graph Theoretic ◽  
Vertex Set ◽  
Finite Commutative Rings

The intersection graph ITΓ(R) of gamma sets in the total graph TΓ(R) of a commutative ring R, is the undirected graph with vertex set as the collection of all γ-sets in the total graph of R and two distinct vertices u and v are adjacent if and only if u ∩ v ≠ ∅. Tamizh Chelvam and Asir [The intersection graph of gamma sets in the total graph I, to appear in J. Algebra Appl.] studied about ITΓ(R) where R is a commutative Artin ring. In this paper, we continue our interest on ITΓ(R) and actually we study about Eulerian, Hamiltonian and pancyclic nature of ITΓ(R). Further, we focus on certain graph theoretic parameters of ITΓ(R) like the independence number, the clique number and the connectivity of ITΓ(R). Also, we obtain both vertex and edge chromatic numbers of ITΓ(R). In fact, it is proved that if R is a finite commutative ring, then χ(ITΓ(R)) = ω(ITΓ(R)). Having proved that ITΓ(R) is weakly perfect for all finite commutative rings, we further characterize all finite commutative rings for which ITΓ(R) is perfect. In this sequel, we characterize all commutative Artin rings for which ITΓ(R) is of class one (i.e. χ′(ITΓ(R)) = Δ(ITΓ(R))). Finally, it is proved that the vertex connectivity and edge connectivity of ITΓ(R) are equal to the degree of any vertex in ITΓ(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.

Complementary equitably totally disconnected equitable domination in graphs

2020 ◽  
pp. 2150043
Author(s):  
P. Nataraj ◽  
R. Sundareswaran ◽  
V. Swaminathan
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Domination Number ◽  
Minimum Cardinality ◽  
Vertex Set ◽  
Domination In Graphs ◽  
Totally Disconnected

In a simple, finite and undirected graph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text], a subset [Formula: see text] of [Formula: see text] is said to be a degree equitable dominating set if for every [Formula: see text] there exists a vertex [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] denotes the degree of [Formula: see text] in [Formula: see text]. The minimum cardinality of such a dominating set is denoted by [Formula: see text] and is called the equitable domination number of [Formula: see text]. In this paper, we introduce Complementary Equitably Totally Disconnected Equitable domination in graphs and obtain some interesting results. Also, we discuss some bounds of this new domination parameter.

Clean graph of a ring

2020 ◽  
pp. 2150156
Author(s):  
Mohammad HABIBI ◽  
Ece YETKİN ÇELİKEL ◽  
Ci̇hat ABDİOĞLU
Keyword(s):  
Chromatic Number ◽  
Crucial Role ◽  
Independence Number ◽  
Domination Number ◽  
Clique Number ◽  
Idempotent Element ◽  
Nonzero Idempotent

Let [Formula: see text] be a ring (not necessarily commutative) with identity. The clean graph [Formula: see text] of a ring [Formula: see text] is a graph with vertices in form [Formula: see text], where [Formula: see text] is an idempotent and [Formula: see text] is a unit of [Formula: see text]; and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] or [Formula: see text]. In this paper, we focus on [Formula: see text], the subgraph of [Formula: see text] induced by the set [Formula: see text] is a nonzero idempotent element of [Formula: see text]. It is observed that [Formula: see text] has a crucial role in [Formula: see text]. The clique number, the chromatic number, the independence number and the domination number of the clean graph for some classes of rings are determined. Moreover, the connectedness and the diameter of [Formula: see text] are studied.

scholarly journals The Non-Crossing Graph

10.37236/1140 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Nathan Linial ◽  
Michael Saks ◽  
David Statter
Keyword(s):  
Chromatic Number ◽  
Independence Number ◽  
Clique Number ◽  
The Other ◽  
Fractional Chromatic Number ◽  
Vertex Set

Two sets are non-crossing if they are disjoint or one contains the other. The non-crossing graph ${\rm NC}_n$ is the graph whose vertex set is the set of nonempty subsets of $[n]=\{1,\ldots,n\}$ with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence number, clique number and clique cover number of this graph are presented. For the chromatic number of this graph we show: $$ n(\log_e n -\Theta(1)) \le \chi({\rm NC}_n) \le n (\lceil\log_2 n\rceil-1). $$

scholarly journals Tensor Product Of Zero-divisor Graphs With Finite Free Semilattices

2017 ◽  
Vol 9 (1) ◽  
pp. 13
Author(s):  
Kemal Toker
Keyword(s):  
Tensor Product ◽  
Chromatic Number ◽  
Zero Divisor ◽  
Independence Number ◽  
Domination Number ◽  
Clique Number ◽  
Perfect Graph ◽  
Chromatic Index

$\Gamma (SL_{X})$ is defined and has been investigated in (Toker, 2016). In this paper our main aim is to extend this study over  $\Gamma (SL_{X})$ to the tensor product. The diameter, radius, girth, domination number, independence number, clique number, chromatic number and chromatic index of $\Gamma (SL_{X_{1}})\otimes \Gamma (SL_{X_{2}})$ has been established. Moreover, we have determined when $\Gamma (SL_{X_{1}})\otimes \Gamma (SL_{X_{2}})$ is a perfect graph.

CAYLEY SUM GRAPHS OF IDEALS OF A COMMUTATIVE RING

2014 ◽  
Vol 96 (3) ◽  
pp. 289-302 ◽  
Author(s):  
M. AFKHAMI ◽  
Z. BARATI ◽  
K. KHASHYARMANESH ◽  
N. PAKNEJAD
Keyword(s):  
Commutative Ring ◽  
Directed Graph ◽  
Undirected Graph ◽  
Clique Number ◽  
Basic Properties ◽  
Vertex Set ◽  
Ring Graph ◽  
Genus One ◽  
Cayley Sum Graph

AbstractLet $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}R$ be a commutative ring, $I(R)$ be the set of all ideals of $R$ and $S$ be a subset of $I^*(R)=I(R)\setminus \{0\}$. We define a Cayley sum digraph of ideals of $R$, denoted by $\overrightarrow{\mathrm{Cay}}^+ (I(R),S)$, as a directed graph whose vertex set is the set $I(R)$ and, for every two distinct vertices $I$ and $J$, there is an arc from $I$ to $J$, denoted by $I\longrightarrow J$, whenever $I+K=J$, for some ideal $K $ in $S$. Also, the Cayley sum graph $ \mathrm{Cay}^+ (I(R), S)$ is an undirected graph whose vertex set is the set $I(R)$ and two distinct vertices $I$ and $J$ are adjacent whenever $I+K=J$ or $J+K=I$, for some ideal $K $ in $ S$. In this paper, we study some basic properties of the graphs $\overrightarrow{\mathrm{Cay}}^+ (I(R),S)$ and $ \mathrm{Cay}^+ (I(R), S)$ such as connectivity, girth and clique number. Moreover, we investigate the planarity, outerplanarity and ring graph of $ \mathrm{Cay}^+ (I(R), S)$ and also we provide some characterization for rings $R$ whose Cayley sum graphs have genus one.

Sign in / Sign up

Export Citation Format

Share Document