scholarly journals THE APPLICATIONS OF ZERO DIVISORS OF SOME FINITE RINGS OF MATRICES IN PROBABILITY AND GRAPH THEORY

2020 ◽  
Vol 83 (1) ◽  
pp. 127-132
Author(s):  
Nurhidayah Zaid ◽  
Nor Haniza Sarmin ◽  
Sanhan Muhammad Salih Khasraw
Keyword(s):  
Graph Theory ◽  
Directed Graph ◽  
Zero Divisor ◽  
Finite Ring ◽  
Finite Rings ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Random Elements

Let R be a finite ring. The zero divisors of R are defined as two nonzero elements of R, say x and y where xy = 0. Meanwhile, the probability that two random elements in a group commute is called the commutativity degree of the group. Some generalizations of this concept have been done on various groups, but not in rings. In this study, a variant of probability in rings which is the probability that two elements of a finite ring have product zero is determined for some ring of matrices over integers modulo n. The results are then applied into graph theory, specifically the zero divisor graph. This graph is defined as a graph where its vertices are zero divisors of R and two distinct vertices x and y are adjacent if and only if xy = 0. It is found that the zero divisor graph of R is a directed graph.

scholarly journals ON VARIETIES OF RINGS WHOSE FINITE RINGS ARE DETERMINED BY THEIR ZERO-DIVISOR GRAPHS

2012 ◽  
Vol 05 (02) ◽  
pp. 1250019 ◽  
Author(s):  
A. S. Kuzmina ◽  
Yu. N. Maltsev
Keyword(s):  
Associative Ring ◽  
Zero Divisor ◽  
Finite Ring ◽  
Finite Rings ◽  
Zero Divisor Graph ◽  
Zero Divisors

The zero-divisor graph Γ(R) of an associative ring R is the graph whose vertices are all nonzero zero-divisors (one-sided and two-sided) of R, and two distinct vertices x and y are joined by an edge if and only if either xy = 0 or yx = 0. In the present paper, we study some properties of ring varieties where every finite ring is uniquely determined by its zero-divisor graph.

FINITE RINGS WITH EULERIAN ZERO-DIVISOR GRAPHS

2012 ◽  
Vol 11 (03) ◽  
pp. 1250055 ◽  
Author(s):  
A. S. KUZMINA
Keyword(s):  
Associative Ring ◽  
Zero Divisor ◽  
Noncommutative Ring ◽  
Finite Rings ◽  
Zero Divisor Graph ◽  
Zero Divisors

The zero-divisor graph Γ(R) of an associative ring R is the graph whose vertices are all non-zero (one-sided and two-sided) zero-divisors of R, and two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0. [S. P. Redmond, The zero-divisor graph of a noncommutative ring, Int. J. Commut. Rings1(4) (2002) 203–211.] In the present paper, all finite rings with Eulerian zero-divisor graphs are described.

Automorphisms of the zero-divisor graph of 2 × 2 matrix ring over ℤps

2017 ◽  
Vol 16 (12) ◽  
pp. 1750227 ◽  
Author(s):  
Hengbin Zhang ◽  
Jizhu Nan ◽  
Gaohua Tang
Keyword(s):  
Positive Integer ◽  
Directed Graph ◽  
Zero Divisor ◽  
Matrix Ring ◽  
Directed Edge ◽  
Ring Of Integers ◽  
Zero Divisor Graph ◽  
Zero Divisors

Let [Formula: see text] be the ring of integers modulo [Formula: see text] where [Formula: see text] is a prime and [Formula: see text] is a positive integer, [Formula: see text] the [Formula: see text] matrix ring over [Formula: see text]. The zero-divisor graph of [Formula: see text], written as [Formula: see text], is a directed graph whose vertices are nonzero zero-divisors of [Formula: see text], and there is a directed edge from a vertex [Formula: see text] to a vertex [Formula: see text] if and only if [Formula: see text]. In this paper, we completely determine the automorphisms of [Formula: see text].

The maximal degree of a zero-divisor graph

2019 ◽  
pp. 2050151
Author(s):  
Husam Q. Mohammad ◽  
Nazar H. Shuker ◽  
Luma A. Khaleel
Keyword(s):  
Maximum Degree ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Finite Ring ◽  
Maximal Degree ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Finite Commutative Rings

The rings considered in this paper are finite commutative rings with identity, which are not fields. For any ring [Formula: see text] which is not a field and which is not necessarily finite, we denote the set of all zero-divisors of [Formula: see text] by [Formula: see text] and [Formula: see text] by [Formula: see text]. Let [Formula: see text] denote the zero-divisor graph of [Formula: see text] and for a finite ring [Formula: see text], let [Formula: see text] denote the maximum degree of [Formula: see text]. We denote [Formula: see text] by [Formula: see text]. The aim of this paper is to study some properties of [Formula: see text].

NILPOTENT FINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS

2008 ◽  
Vol 01 (04) ◽  
pp. 565-574 ◽  
Author(s):  
A. S. KUZ'MINA ◽  
Yu. N. MALTSEV
Keyword(s):  
Associative Ring ◽  
Zero Divisor ◽  
Finite Rings ◽  
Zero Divisor Graph ◽  
Zero Divisors

The zero-divisor graph Γ(R) of an associative ring R is the graph with all vertices non-zero zero-divisors (one-sided and two-sided) of R, and two distinct vertices x and y are joined by an edge iff xy = 0 or yx = 0 ([10]). In the present paper, we describe all nilpotent finite rings with planar zero-divisor graphs.

scholarly journals Role of zero-divisor graph in power set ring

2021 ◽  
Vol 4 (3) ◽  
pp. 181-185
Author(s):  
Abdul Jamil Nazary
Keyword(s):  
Graph Theory ◽  
Zero Divisor ◽  
Past Research ◽  
The Past ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Library Research ◽  
Power Set ◽  
Leonhard Euler

The first article about graph theory was written by Leonhard Euler the famous Swiss mathematician which was published in 1736. Primarily, the idea of graph was not important as point of mathematics because it mostly deals with recreational puzzles. But the recent improvement in mathematics specially, its application brought a strong revolution in graph theory. Therefore, this article is written under the title of (Role of Zero-divisor graph in power set ring). This study clarifies the role of the zero-fraction graph in the strength ring and the library research method was used for the collection of information from the past research. This study first introduces the zero-divisor graph set of alternatives in R ring. Then presents the Role of Zero-divisor graph in power set ring. Whereas the vertex is denoted with K1 and the elements of an optional ring which are not zero-divisors they are the vertices without edges of that ring in zero-divisor graph. Next, we will study when a graph is planar in power set ring. The research found out that if the element numbers of set X  is less than 4, the graph of zero-divisor graph ring of P X( ) is planar and if the element numbers of set X is greater than or equals to 4, the zero-divisor graph ring is not planar.

scholarly journals On the Zero Divisor Graphs of a Class of Commutative Completely Primary Finite Rings

2016 ◽  
Vol 12 (3) ◽  
pp. 6021-6026
Author(s):  
Maurice Oduor ◽  
Walwenda Shadrack Adero
Keyword(s):  
Maximal Ideal ◽  
Zero Divisor ◽  
Finite Ring ◽  
Finite Rings ◽  
Zero Divisors ◽  
Unique Maximal Ideal

Let R be a Completely Primary Finite Ring with a unique maximal ideal Z(R)), satisfying ((Z(R))n−1 ̸= (0) and (Z(R))n = (0): The structures of the units some classes of such rings have been determined. In this paper, we investigate the structures of the zero divisors of R:

scholarly journals Rings with a few more zero-divisors

1971 ◽  
Vol 5 (2) ◽  
pp. 271-274 ◽  
Author(s):  
C. Christensen
Keyword(s):  
Zero Divisor ◽  
Finite Ring ◽  
Left Zero ◽  
Finite Rings ◽  
Zero Divisors ◽  
Unital Rings

It is well-known that every finite ring with non-zero-divisors has order not exceeding the square of the order n of its left zero-divisor set. Unital rings whose order is precisely n2 have been described already. Here we discuss finite rings with relatively larger zero-divisor sets, namely those of order greater than n3/2. This is achieved by describing the class of all finite rings with left composition length two at most, and using a theorem relating the left composition length of a finite ring to the size of its left zero-divisor set.

Associate class graph of zero-divisors of a commutative ring

2019 ◽  
Vol 19 (08) ◽  
pp. 2050155
Author(s):  
Gaohua Tang ◽  
Guangke Lin ◽  
Yansheng Wu
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Zero Divisor ◽  
New Class ◽  
Associate Class ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Class Graph

In this paper, we introduce the concept of the associate class graph of zero-divisors of a commutative ring [Formula: see text], denoted by [Formula: see text]. Some properties of [Formula: see text], including the diameter, the connectivity and the girth are investigated. Utilizing this graph, we present a new class of counterexamples of Beck’s conjecture on the chromatic number of the zero-divisor graph of a commutative ring.

scholarly journals When Is the Complement of the Zero-Divisor Graph of a Commutative Ring Complemented?

ISRN Algebra ◽  
2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
S. Visweswaran
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Zero Divisor Graph ◽  
Zero Divisors

Let be a commutative ring with identity which has at least two nonzero zero-divisors. Suppose that the complement of the zero-divisor graph of has at least one edge. Under the above assumptions on , it is shown in this paper that the complement of the zero-divisor graph of is complemented if and only if is isomorphic to as rings. Moreover, if is not isomorphic to as rings, then, it is shown that in the complement of the zero-divisor graph of , either no vertex admits a complement or there are exactly two vertices which admit a complement.

Sign in / Sign up

Export Citation Format

Share Document