Results 101 to 110 of about 1,460,755 (212)
The Zero-Divisor Graphs of Variation Monogenic Semigroups
The undirected graph Γ(〖VS〗_Mn) is the zero-divisor graph of the monogenic semigroup SM with zero. The non-zero vertices xi and xj of this graph are adjacent whenever i + j > n and gcd(i,j)=1, where n is the order of Γ(〖VS〗_Mn).
Bana Jawid Al Subaiei +1 more
doaj +1 more source
Laplacian spectrum of weakly zero-divisor graph of the ring $\mathbb{Z}_{n}$
Let $R$ be a commutative ring with unity. The weakly zero-divisor graph $W\Gamma(R)$ of the ring $R$ is the simple undirected graph whose vertices are nonzero zero-divisors of $R$ and two vertices $x$, $y$ are adjacent if and only if there exists $r\in {\
Mathil, Praveen +2 more
core
On generalized zero divisor graph of a poset
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vinayak Joshi +2 more
openaire +3 more sources
Induced subgraphs of zero-divisor graphs
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
Chelvam, T. Tamizh +3 more
core
A Submodule-Based Zero Divisor Graph for Modules
Let R be a commutative ring with identity and M be an R-module. The zero divisor graph of M is denoted by Gamma(M). In this study, we are going to generalize the zero divisor graph Gamma(M) to submodule-based zero divisor graph Gamma(M, N) by replacing ...
Payrovi, Shiroyeh +2 more
core +1 more source
A New Type of Zero Divisor Graphs of a Lattice, t-Zero Divisor Graphs
In this paper, we introduce the t-zero divisor graph $\Gamma_{T}(L)$, which is a generalization of the zero divisor graph of a lattice $\Gamma(L)$, where $t$ is a triangular norm on $L$. We investigate which properties hold in $t$-zero divisor graphs for special $t$-norms while giving some additional properties of the zero divisor graph.
openaire +2 more sources
The zero divisor graph of 2 x 2 matrices over a field
A zero divisor graph, Γ(R), is formed from a ring R by having each element of Z(R)\{0} to be a vertex in the graph and having two vertices u and v adjacent if the corresponding elements from the ring are nonequal and have product equal to zero.
Ashrafi, Ali Reza, Tadayyonfar, Adel
core
SOME PROPERTIES OF THE ZERO-DIVISOR GRAPH FOR THE RING OF GAUSSIAN INTEGERS MODULO n
This paper is a continuation for the study of the zero-divisor graph for the ring of Gaussian integers modulo n, Γ(ℤn[i]) in [8] (Emad Abu Osba, Salah Al-Addasi and Nafez Abu Jaradeh. Zero divisor graph for the ring of Gaussin integers modulo n.
EMAD ABU OSBA +2 more
core +1 more source
Associated to every nonzero commutative ring with identity is a graph whose vertices are the nonzero zero-divisors, and such that two distinct vertices x and y are adjacent if and only if xy = 0.
Chapman, Jeremy M.
core
The Wiener index and the Wiener complexity of the zero-divisor graph of a ring [PDF]
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 ...
Dolžan, David
core +1 more source

