Results 1 to 10 of about 224 (113)
A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors [PDF]
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.
Cameron G. Wickham, Sandra Spiroff
exaly +3 more sources
The Zero Divisor Graph of the Ring Zqp.
In this paper we construct a star zero divisor graph from the zero divisor graph of the ring Zqp. The star zero divisor graph is obtained by removing some vertices from the zero divisor graph Γ(Zqp), in different ways , but the best way to get star zero ...
Nazar H. Shuker, Payman A. Rashed
doaj +2 more sources
Upper dimension and bases of zero-divisor graphs of commutative rings
For a commutative ring with non-zero zero divisor set , the zero divisor graph of is with vertex set , where two distinct vertices and are adjacent if and only if .
S. Pirzada, M. Aijaz, S.P. Redmond
doaj +2 more sources
The Zero-Divisor Graphs of Rings and Semirings [PDF]
In this paper we study zero-divisor graphs of rings and semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or ...
David Dolžan, Polona Oblak
exaly +3 more sources
On Zero-Divisor Graphs of Finite Rings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saieed Akbari
exaly +3 more sources
Frequency Assignment Model of Zero Divisor Graph [PDF]
Given a frequency assignment network model is a zero divisor graph Γ=V,E of commutative ring Rη, in this model, each node is considered to be a channel and their labelings are said to be the frequencies, which are assigned by the L2,1 and L3,2,1 labeling
R. Radha, N. Mohamed Rilwan
doaj +3 more sources
A graph-theoretic approach to ring analysis: Dominant metric dimensions in zero-divisor graphs
This article investigates the concept of dominant metric dimensions in zero divisor graphs (ZD-graphs) associated with rings. Consider a finite commutative ring with unity, denoted as R, where nonzero elements x and y are identified as zero divisors if ...
Nasir Ali +4 more
doaj +3 more sources
Zero-divisor graphs and zero-divisor functors
Inspired by a very recent work of A. Đurić, S. Jevđenić and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings that includes all of the classical definitions already known in the literature. We provide an interpretation of such graphs by means of a functor that we call zero-divisor functor and which is associated with a ...
Enrico Sbarra, Maurizio Zanardo
openaire +3 more sources
The wiener index of the zero-divisor graph for a new class of residue class rings
The zero-divisor graph of a commutative ring R, denoted by Γ(R), is a graph whose two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0.
Yinhu Wei, Ricai Luo
doaj +1 more source
Total perfect codes in graphs realized by commutative rings [PDF]
Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset $C(G ...
Rameez Raja
doaj +1 more source

