Results 21 to 30 of about 22,120 (235)
Zero-divisor graphs and zero-divisor functors
Journal of Algebra and Its Applications, 2023 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
Total perfect codes in graphs realized by commutative rings [PDF]
Transactions on Combinatorics, 2022 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
The Wiener Index and the Wiener Complexity of the Zero-Divisor Graph of a Ring [PDF]
Bulletin of the Iranian Mathematical Society, 2023 We calculate the Wiener index of the zero-divisor graph of a finite semisimple ring. We also calculate the Wiener complexity of the zero-divisor graph of a finite simple ring and find an upper bound for the Wiener complexity in the semisimple case.
David Dolžan
semanticscholar +1 more source
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
IET Networks, EarlyView., 2022 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
On a New Extension of the Zero-Divisor Graph [PDF]
Algebra Colloquium, 2020 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).
A. Cherrabi +3 more
openaire +3 more sources
Non Deterministic Zero Divisor Graph
Ratio Mathematica, 2023 A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined.
Shakila Banu, Naveena Selvaraj
doaj +1 more source
On distance Laplacian spectrum of zero divisor graphs of the ring $\mathbb{Z}_{n}$
Karpatsʹkì Matematičnì Publìkacìï, 2021 For a finite commutative ring $\mathbb{Z}_{n}$ with identity $1\neq 0$, the zero divisor graph $\Gamma(\mathbb{Z}_{n})$ is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices $x$ and $y$ are adjacent if and
S. Pirzada, B.A. Rather, T.A. Chishti
doaj +1 more source
Zero-divisor ideals and realizable zero-divisor graphs [PDF]
Involve, a Journal of Mathematics, 2009 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 +4 more sources
Distributive lattices and some related topologies in comparison with zero-divisor graphs [PDF]
Categories and General Algebraic Structures with Applications, 2021 In this paper,for a distributive lattice $\mathcal L$, we study and compare some lattice theoretic features of $\mathcal L$ and topological properties of the Stone spaces ${\rm Spec}(\mathcal L)$ and ${\rm Max}(\mathcal L)$ with the corresponding graph ...
Saeid Bagheri, mahtab Koohi Kerahroodi
doaj +1 more source
Induced subgraphs of zero-divisor graphs
Discrete Mathematics, 2023 The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the sense that every finite graph is isomorphic to an induced subgraph of a zero-divisor graph.
G. Arunkumar +3 more
openaire +4 more sources