scholarly journals Five-point zero-divisor graphs determined by equivalence classes

2011 ◽  
Vol 4 (1) ◽  
pp. 53-64
Author(s):  
Florida Levidiotis ◽  
Sandra Spiroff
Keyword(s):  
Zero Divisor ◽  
Equivalence Classes

scholarly journals A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors

2011 ◽  
Vol 39 (7) ◽  
pp. 2338-2348 ◽  
Author(s):  
Sandra Spiroff ◽  
Cameron Wickham
Keyword(s):  
Zero Divisor ◽  
Equivalence Classes ◽  
Zero Divisor Graph ◽  
Zero Divisors

scholarly journals On Reduced Zero-Divisor Graphs of Posets

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Ashish Kumar Das ◽  
Deiborlang Nongsiang
Keyword(s):  
Zero Divisor ◽  
Chain Condition ◽  
Equivalence Classes ◽  
Prime Ideals ◽  
Zero Divisors ◽  
Ascending Chain Condition

We study some properties of a graph which is constructed from the equivalence classes of nonzero zero-divisors determined by the annihilator ideals of a poset. In particular, we demonstrate how this graph helps in identifying the annihilator prime ideals of a poset that satisfies the ascending chain condition for its proper annihilator ideals.

scholarly journals The Graph of Equivalence Classes of Zero Divisors

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Vinayak Joshi ◽  
B. N. Waphare ◽  
H. Y. Pourali
Keyword(s):  
Zero Divisor ◽  
Equivalence Classes ◽  
Zero Divisors ◽  
Boolean Lattices

We introduce a graph GE(L) of equivalence classes of zero divisors of a meet semilattice L with 0. The set of vertices of GE(L) are the equivalence classes of nonzero zero divisors of L and two vertices [x] and [y] are adjacent if and only if [x]∧[y]=[0]. It is proved that GE(L) is connected and either it contains a cycle of length 3 or GE(L)≅K2. It is known that two Boolean lattices L1 and L2 have isomorphic zero divisor graphs if and only if L1≅L2. This result is extended to the class of SSC meet semilattices. Finally, we show that Beck's Conjecture is true for GE(L) .

scholarly journals On planarity of compressed zero-divisor graphs associated to commutative rings

2020 ◽  
Vol 29 (2) ◽  
pp. 131-136
Author(s):  
M. IMRAN BHAT ◽  
S. PIRZADA ◽  
AHMAD M. ALGHAMDI
Keyword(s):  
Equivalence Class ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Equivalence Classes ◽  
Local Rings ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Vertex Set

The equivalence class [r] of an element r ∈ R is the set of zero-divisors s such that ann(r) = ann(s), that is, [r] = {s ∈ R : ann(r) = ann(s). The compressed zero-divisor graph, denoted by Γc(R), is the compression of a zero-divisor graph, in which the vertex set is the set of all equivalence classes of nonzero zero-divisors of a ring R, that is, the vertex set of Γc(R) is Re − {[0], [1]}, where Re = {[r] : r ∈ R} and two distinct equivalence classes [r] and [s] are adjacent if and only if rs = 0. In this article, we investigate the planarity of Γc(R) for some finite local rings of order p 2 , p 3 and determine the planarity of compressed zero-divisor graph of some local rings of order 32, whose zero-divisor graph is nonplanar. Further, we determine values of m and n for which Γc(Zn) and Γc(Zn[x]/(xm)) are planar.

THE CYLINDRICAL CROSSING NUMBER OF ZERO DIVISOR GRAPHS

2020 ◽  
Vol 9 (8) ◽  
pp. 5901-5908
Author(s):  
M. Sagaya Nathan ◽  
J. Ravi Sankar
Keyword(s):  
Zero Divisor ◽  
Crossing Number

Eigenvalues of zero divisor graphs of principal ideal rings

2021 ◽  
pp. 1-15
Author(s):  
Jitsupat Rattanakangwanwong ◽  
Yotsanan Meemark
Keyword(s):  
Principal Ideal ◽  
Zero Divisor

scholarly journals Correction to: Classification of non-local rings with genus two zero-divisor graphs

2021 ◽  
Vol 25 (4) ◽  
pp. 3355-3356
Author(s):  
T. Asir ◽  
K. Mano ◽  
T. Tamizh Chelvam
Keyword(s):  
Zero Divisor ◽  
Local Rings ◽  
Non Local ◽  
Genus Two

scholarly journals MET: a Java package for fast molecule equivalence testing

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann
Keyword(s):  
Chemical Properties ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Equivalence Classes ◽  
Equivalence Testing ◽  
Equivalence Test ◽  
Graph Isomorphism Problem ◽  
2D Structure ◽  
Node Labels ◽  
Labelled Graphs

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.

Sign in / Sign up

Export Citation Format

Share Document