Some properties about the zero-divisor graphs of quasi-ordered sets

2019 ◽  
Vol 19 (04) ◽  
pp. 2050074
Author(s):  
Junye Ma ◽  
Qingguo Li ◽  
Hui Li
Keyword(s):  
Zero Divisor ◽  
Ordered Set ◽  
Line Graph ◽  
Prime Ideals ◽  
Complete Graphs ◽  
Ordered Sets ◽  
Graph Theoretic ◽  
Zero Divisor Graph ◽  
Complete Bipartite Graphs ◽  
Minimal Prime

In this paper, we study some graph-theoretic properties about the zero-divisor graph [Formula: see text] of a finite quasi-ordered set [Formula: see text] with a least element 0 and its line graph [Formula: see text]. First, we offer a method to find all the minimal prime ideals of a quasi-ordered set. Especially, this method is applicable for a partially ordered set. Then, we completely characterize the diameter and girth of [Formula: see text] by the minimal prime ideals of [Formula: see text]. Besides, we perfectly classify all finite quasi-ordered sets whose zero-divisor graphs are complete graphs, star graphs, complete bipartite graphs, complete [Formula: see text]-partite graphs. We also investigate the planarity of [Formula: see text]. Finally, we obtain the characterization for the line graph [Formula: see text] in terms of its diameter, girth and planarity.

scholarly journals On the diameter of the graph ГAnn(M)(R)

Filomat ◽  
2012 ◽  
Vol 26 (3) ◽  
pp. 623-629 ◽  
Author(s):  
David Anderson ◽  
Shaban Ghalandarzadeh ◽  
Sara Shirinkam ◽  
Parastoo Rad
Keyword(s):  
Commutative Ring ◽  
Complete Graph ◽  
Zero Divisor ◽  
Prime Ideals ◽  
Annihilator Ideal ◽  
Zero Divisor Graph ◽  
Minimal Prime ◽  
The Relationship ◽  
The Ideal

For a commutative ring R with identity, the ideal-based zero-divisor graph, denoted by ?I (R), is the graph whose vertices are {x ? R\I|xy ? I for some y ? R\I}, and two distinct vertices x and y are adjacent if and only if xy?I. In this paper, we investigate an annihilator ideal-based zero-divisor graph, denoted by ?Ann(M)(R), by replacing the ideal I with the annihilator ideal Ann(M) for an R-module M. We also study the relationship between the diameter of ?Ann(M) (R) and the minimal prime ideals of Ann(M). In addition, we determine when ?Ann(M)(R) is complete. In particular, we prove that for a reduced R-module M, ?Ann(M) (R) is a complete graph if and only if R ? Z2?Z2 and M ? M1?M2 for M1 and M2 nonzero Z2-modules.

scholarly journals On the Line Graph of the Zero Divisor Graph for the Ring of Gaussian Integers Modulo n

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Khalida Nazzal ◽  
Manal Ghanem
Keyword(s):  
Zero Divisor ◽  
Line Graph ◽  
Domination Number ◽  
The Other ◽  
Graph Invariants ◽  
Gaussian Integers ◽  
Zero Divisor Graph ◽  
Other Hand

Let Γ(ℤn[i]) be the zero divisor graph for the ring of the Gaussian integers modulo n. Several properties of the line graph of Γ(ℤn[i]), L(Γ(ℤn[i])) are studied. It is determined when L(Γ(ℤn[i])) is Eulerian, Hamiltonian, or planer. The girth, the diameter, the radius, and the chromatic and clique numbers of this graph are found. In addition, the domination number of L(Γ(ℤn[i])) is given when n is a power of a prime. On the other hand, several graph invariants for Γ(ℤn[i]) are also determined.

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.

ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET

2017 ◽  
Vol 97 (2) ◽  
pp. 185-193 ◽  
Author(s):  
SARIKA DEVHARE ◽  
VINAYAK JOSHI ◽  
JOHN LAGRANGE
Keyword(s):  
Partially Ordered Set ◽  
Zero Divisor ◽  
Ordered Set ◽  
Clique Number ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Partially Ordered ◽  
Zero Divisor Graph

In this paper, it is proved that the complement of the zero-divisor graph of a partially ordered set is weakly perfect if it has finite clique number, completely answering the question raised by Joshi and Khiste [‘Complement of the zero divisor graph of a lattice’,Bull. Aust. Math. Soc. 89(2014), 177–190]. As a consequence, the intersection graph of an intersection-closed family of nonempty subsets of a set is weakly perfect if it has finite clique number. These results are applied to annihilating-ideal graphs and intersection graphs of submodules.

On the intersection graph of gamma sets in the zero-divisor graph

2015 ◽  
Vol 07 (01) ◽  
pp. 1450067 ◽  
Author(s):  
T. Tamizh Chelvam ◽  
K. Selvakumar
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Intersection Graph ◽  
Graph Theoretic ◽  
Zero Divisor Graph ◽  
Vertex Set

Let R be a commutative ring. The intersection graph of gamma sets in the zero-divisor graph Γ(R) of R is the graph IΓ(R) with vertex set as the collection of all gamma sets of the zero-divisor graph Γ(R) of R and two distinct vertices A and B are adjacent if and only if A ∩ B ≠ ∅. In this paper, we study about various properties of IΓ(R) and investigate the interplay between the graph theoretic properties of IΓ(R) and the ring theoretic properties of R.

scholarly journals Some results in types of extensions of MV-algebras

2019 ◽  
Vol 105 (119) ◽  
pp. 161-177
Author(s):  
F. Forouzesh ◽  
F. Sajadian ◽  
M. Bedrood
Keyword(s):  
Zero Divisor ◽  
Prime Ideals ◽  
Inverse Topology ◽  
Spectral Topology ◽  
Minimal Prime ◽  
Mv Algebras

We introduce the notions of zero divisor and extension, contraction of ideals in MV-algebras and several interesting types of extensions of MV-algebras. In particular, we show what kinds of extensions MV-algebras will lead in a homeomorphism of the spectral topology and inverse topology on minimal prime ideals. Finally, we investigate the relations among types of extensions of MV-algebras.

The Ordering of Spec R

1976 ◽  
Vol 28 (4) ◽  
pp. 820-835 ◽  
Author(s):  
William J. Lewis ◽  
Jack Ohm
Keyword(s):  
Commutative Ring ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered Sets ◽  
Prime Ideals ◽  
Ordered Sets ◽  
Partially Ordered

Let Specie denote the set of prime ideals of a commutative ring with identity R, ordered by inclusion; and call a partially ordered set spectral if it is order isomorphic to Spec R for some R. What are some conditions, necessary or sufficient, for a partially ordered set X to be spectral? The most desirable answer would be the type of result that would allow one to stare at the diagram of a given X and then be able to say whether or not X is spectral. For example, it is known that finite partially ordered sets are spectral (see [2] or [5]).

On the line graphs of zero-divisor graphs of posets

2016 ◽  
Vol 16 (07) ◽  
pp. 1750121 ◽  
Author(s):  
Mahdi Reza Khorsandi ◽  
Atefeh Shekofteh
Keyword(s):  
Zero Divisor ◽  
Line Graph ◽  
Line Graphs ◽  
Zero Divisor Graph

In this paper, we study the zero-divisor graph [Formula: see text] of a poset [Formula: see text] and its line graph [Formula: see text]. We characterize all posets whose [Formula: see text] are star, finite complete bipartite or finite. Also, we prove that the diameter of [Formula: see text] is at most 3 while its girth is either 3, 4 or [Formula: see text]. We also characterize [Formula: see text] in terms of their diameter and girth. Finally, we classify all posets [Formula: see text] whose [Formula: see text] are planar.

Diameter and girth of the multiplicative zero-divisor graph of multiplicative lattices

2016 ◽  
Vol 09 (04) ◽  
pp. 1650071
Author(s):  
Vinayak Joshi ◽  
Sachin Sarode
Keyword(s):  
Zero Divisor ◽  
Commutative Rings ◽  
Zero Divisor Graph ◽  
Multiplicative Lattice ◽  
Minimal Prime ◽  
Prime Elements ◽  
Multiplicative Lattices

In this paper, we study the multiplicative zero-divisor graph [Formula: see text] of a multiplicative lattice [Formula: see text]. Under certain conditions, we prove that for a reduced multiplicative lattice [Formula: see text] having more than two minimal prime elements, [Formula: see text] contains a cycle and [Formula: see text]. This essentially settles the conjecture of Behboodi and Rakeei [The annihilating-ideal graph of commutative rings II, J. Algebra Appl. 10(4) (2011) 741–753]. Further, we have characterized the diameter of [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document