Results 21 to 30 of about 1,233,365 (217)
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 +2 more sources
Classification of Genus Three Zero-Divisor Graphs
In this paper, we consider the problem of classifying commutative rings according to the genus number of its associating zero-divisor graphs. The zero-divisor graph of R, where R is a commutative ring with nonzero identity, denoted by Γ(R), is the ...
Turki Alsuraiheed +2 more
core +1 more source
Distances in zero-divisor and total graphs from commutative rings–A survey
There are so many ways to construct graphs from algebraic structures. Most popular constructions are Cayley graphs, commuting graphs and non-commuting graphs from finite groups and zero-divisor graphs and total graphs from commutative rings.
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Exploring the properties of the zero-divisor graph of direct product of $\ast$-rings [PDF]
In this paper, we delve into the study of zero-divisor graphs in rings equipped with an involution. Specifically, we focus on abelian Rickart $\ast$-rings.
Mohd Nazim +2 more
doaj +1 more source
The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from ...
Amal S. Alali +5 more
doaj +1 more source
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
Zero-divisor graphs of idealizations [PDF]
We consider zero-divisor graphs of idealizations of commutative rings. Specifically, we look at the preservation, or lack thereof, of the diameter and girth of the zero-divisor graph of a ring when extending to idealizations of the ...
Stickles, J. +3 more
core +1 more source
The Graph of Equivalence Classes of Zero Divisors [PDF]
We introduce a graph GE(L) of equivalence classes of zero divisors of a meet semilattice L with 0. The set of vertices of GE(L) are the equivalence classes of nonzero zero divisors of L and two vertices [x] and [y] are adjacent if and only if [x]∧[y]=[0]. It is proved that GE(L) is connected and either it contains a cycle of length 3 or GE(L)≅K2. It is
Vinayak Joshi +2 more
openaire +2 more sources
On the eigenvalues of zero-divisor graph associated to finite commutative ring
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 +1 more source
Upper dimension and bases of zero-divisor graphs of commutative rings
For a commutative ring with non-zero zero divisor set , the zero divisor graph of is with vertex set , where two distinct vertices and are adjacent if and only if .
S. Pirzada, M. Aijaz, S.P. Redmond
doaj +1 more source

