Results 51 to 60 of about 1,460,755 (212)
On a New Extension of the Zero-Divisor Graph [PDF]
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).
Cherrabi, A. +3 more
openaire +2 more sources
The total zero-divisor graph of commutative rings [PDF]
In this paper we initiate the study of the total zero-divisor graphs over commutative rings with unity. These graphs are constructed by both relations that arise from the zero-divisor graph and from the total graph of a ring.
Đurić, Alen +3 more
core +1 more source
Degree Distance of Zero-Divisor Graph Г[Z_n ] [PDF]
In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime ...
N.feyza YALÇIN, N.feyza Yalçın
core +2 more sources
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
Boxicity of zero divisor graphs
A $d$-dimensional box is the cartesian product $R_i\times\cdots\times R_d$ where each $R_i$ is a closed interval on the real line. The boxicity of a graph, denoted as $box(G)$, is the minimum integer $d\geq 0$ such that $G$ is the intersection graph of a collection of $d$-dimensional boxes.
L. Sunil Chandran, Suraj Kumar Sahoo
openaire +3 more sources
Component graphs of vector spaces and zero-divisor graphs of ordered sets
In this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar +2 more
doaj +1 more source
COMPLEMENT OF THE ZERO DIVISOR GRAPH OF A LATTICE [PDF]
AbstractIn this paper, we determine when $\mathop{({\Gamma }_{I} (L))}\nolimits ^{c} $, the complement of the zero divisor graph ${\Gamma }_{I} (L)$ with respect to a semiprime ideal $I$ of a lattice $L$, is connected and also determine its diameter, radius, centre and girth. Further, a form of Beck’s conjecture is proved for ${\Gamma }_{I} (L)$ when $\
Joshi, Vinayak, Khiste, Anagha
openaire +1 more source
Local Rings with Genus Two Zero Divisor Graph
To each commutative ring R we can associate a graph, the zero divisor graph of R, whose vertices are the zero divisors of R, and such that two vertices are adjacent if their product is zero.
Bloomfield, Nathan +3 more
core +1 more source
Eulerian and pancyclic zero-divisor graphs of ordered sets
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 +1 more source
Ring Classification of Ideal-Based Zero Divisor Graph with Vertices 9
Let R be a finite commutative ring with a non-zero unit, and L be an ideal of R. focuses on expanding the notation of the Zero Divisor Graph to create what is known as the Ideal-Based Zero Divisor Graph. The main goal is to classify rings using the ideal-
Husam Q. Mohammad +2 more
doaj +1 more source

