Results 1 to 10 of about 24,531 (183)
The wiener index of the zero-divisor graph for a new class of residue class rings [PDF]
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 +2 more sources
Non Deterministic Zero Divisor Graph
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 +2 more sources
A graph-theoretic approach to ring analysis: Dominant metric dimensions in zero-divisor graphs [PDF]
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 +2 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 +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
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
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
Comments on the Clique Number of Zero-Divisor Graphs of Zn
In 2008, J. Skowronek-kazio´w extended the study of the clique number ωGZn to the zero-divisor graph of the ring Zn, but their result was imperfect. In this paper, we reconsider ωGZn of the ring Zn and give some counterexamples. We propose a constructive
Yanzhao Tian, Lixiang Li
doaj +1 more source
Distributive lattices and some related topologies in comparison with zero-divisor graphs [PDF]
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 [PDF]
Funding: Peter J. Cameron acknowledges the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no. EP/R014604/1)
Arunkumar, G +3 more
core +1 more source

