Results 41 to 50 of about 1,637,051 (209)
Electronic Notes in Discrete Mathematics, 2017 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
THE DOMINATION OF ZERO DIVISOR GRAPH ON THE LINE GRAPH [PDF]
, 2020 The directed Zero divisor graph is a graph constructed out of a non-Commutative ring R and its non-zero divisors. In this paper we find various domination parameter for the zero-divisor graph.
R, PREMKUMAR
core
On bipartite zero-divisor graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dancheng Lu, Tongsuo Wu
openaire +1 more source
The total zero-divisor graph of commutative rings [PDF]
, 2018 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
Distances in zero-divisor and total graphs from commutative rings–A survey
AKCE International Journal of Graphs and Combinatorics, 2016 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
Discrete Applied MathematicsA $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
COMPLEMENT OF THE ZERO DIVISOR GRAPH OF A LATTICE [PDF]
Bulletin of the Australian Mathematical Society, 2013 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
Degree Distance of Zero-Divisor Graph Г[Z_n ] [PDF]
, 2020 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
Component graphs of vector spaces and zero-divisor graphs of ordered sets
AKCE International Journal of Graphs and CombinatoricsIn 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
Local Rings with Genus Two Zero Divisor Graph
, 2010 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