Results 1 to 10 of about 362 (137)
On zero-divisor graphs of finite rings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Akbari
exaly +3 more sources
A graph-theoretic approach to ring analysis: Dominant metric dimensions in zero-divisor graphs [PDF]
Ali AKGÜL +2 more
exaly +2 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
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
Abstract As the problems concerning the number of information to be optimised is increasing, the optimisation level is getting higher, the target information is more diversified, and the algorithms are becoming more complex; the traditional algorithms such as particle swarm and differential evolution are far from being able to deal with this situation ...
Linfeng Huang
wiley +1 more source
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.
Spiroff, Sandra, Wickham, Cameron
openaire +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 Dolzan, Polona Oblak
openaire +1 more source
On a New Extension of the Zero-Divisor Graph [PDF]
In this paper, we introduce a new graph whose vertices are the non-zero zero-divisors of a commutative ring R, and for distincts elements x and y in the set Z(R)* of the non-zero zero-divisors of R, x and y are adjacent if and only if xy = 0 or x + y ∈ Z(R).
Cherrabi, A. +3 more
openaire +2 more sources
GENERALIZATIONS OF THE ZERO-DIVISOR GRAPH
Summary: Let \(R\) be a commutative ring with \(1\neq 0\) and \(Z(R)\) its set of zerodivisors. The zero-divisor graph of \(R\) is the (simple) graph \(\Gamma \)(R) with vertices \(Z(R) \backslash \{0\}\), and distinct vertices \(x\)and \(y\) are adjacent if and only if \(xy= 0\).
ANDERSON, David F., MCCLURKİN, Grace
openaire +4 more sources
Zero-divisor ideals and realizable zero-divisor graphs [PDF]
We seek to classify the sets of zero-divisors that form ideals based on their zero-divisor graphs. We offer full classification of these ideals within finite commutative rings with identity. We also provide various results concerning the realizability of a graph as a zero-divisor graph. 1.
Axtell, Michael +2 more
openaire +3 more sources
Abstract Let R be a finite commutative ring with unity ( 1 ≠ 0 ) and let Z ( R ) ⁎ be the set of non-zero zero-divisors of R. We associate a (simple) graph Γ ( R ) to R with vertices as elements of R and for distinct x , y ∈ R , the vertices x and y are adjacent if and only if xy = 0.
Deepa Sinha +2 more
openaire +1 more source

