Results 1 to 10 of about 1,513 (227)
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
On the eigenvalues of zero-divisor graph associated to finite commutative ring [PDF]
Let Z(R) be the set of zero-divisors of a commutative ring R with non-zero identity and be the set of non-zero zero-divisors of R. The zero-divisor graph of R, denoted by is a simple graph whose vertex set is and two vertices are adjacent if and only if ...
S. Pirzada +2 more
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
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings [PDF]
In recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti +2 more
doaj +2 more sources
On Domination in Zero-Divisor Graphs [PDF]
AbstractWe first determine the domination number for the zero-divisor graph of the product of two commutative rings with 1. We then calculate the domination number for the zero-divisor graph of any commutative artinian ring. Finally, we extend some of the results to non-commutative rings in which an element is a left zero-divisor if and only if it is a
Nader Jafari Rad +2 more
openalex +2 more sources
On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings
For a simple connected graph $ G $ of order $ n $, the distance signless Laplacian matrix is defined by $ D^{Q}(G) = D(G) + Tr(G) $, where $ D(G) $ and $ Tr(G) $ is the distance matrix and the diagonal matrix of vertex transmission degrees, respectively.
Bilal A. Rather +4 more
doaj +2 more sources
Eulerian and pancyclic zero-divisor graphs of ordered sets [PDF]
In this paper, we determine when the zero-divisor graph of a special class of a finite pseudocomplemented poset is Eulerian. Also, we deal with Hamiltonian, vertex pancyclic, and edge pancyclic properties of the complement of a zero-divisor graph of ...
Nilesh Khandekar, Vinayak Joshi
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
τ-IRREDUCIBLE DIVISOR GRAPHS IN COMMUTATIVE RINGS WITH ZERO-DIVISORS
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their attention to studying divisor graphs of non-zero elements in integral domains.
Christopher Park Mooney
openalex +6 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

