Zero-Divisor Graphs for Group Rings

Let R be a commutative ring with 1 ≠ 0, G be a nontrivial finite group, and let Z(R) be the set of zero divisors of R. The zero-divisor graph of R is defined as the graph Γ(R) whose vertex set is Z(R)* = Z(R)?{0} and two distinct vertices a and b are adjacent if and only if ab = 0. In this paper, we investigate the interplay between the ring-theoretic properties of group rings RG and the graph-theoretic properties of Γ(RG). We characterize finite commutative group rings RG for which either diam(Γ(RG)) ≤2 or gr(Γ(RG)) ≥4. Also, we investigate the isomorphism problem for zero-divisor graphs of group rings. First, we show that the rank and the cardinality of a finite abelian p-group are determined by the zero-divisor graph of its modular group ring. With the notion of zero-divisor graphs extended to noncommutative rings, it is also shown that two finite semisimple group rings are isomorphic if and only if their zero-divisor graphs are isomorphic. Finally, we show that finite noncommutative reversible group rings are determined by their zero-divisor graphs.     

Weakly central-vertex complete graphs with applications to commutative rings

The zero-divisor graph of a commutative ring R is the graph whose vertices consist of the nonzero zero-divisors of R such that distinct vertices x and y are adjacent if and only if xy=0. In this paper, a decomposition theorem is provided to describe weakly central-vertex complete graphs of radius 1. This characterization is then applied to the class of zero-divisor graphs of commutative rings. For finite commutative rings whose zero-divisor graphs are not isomorphic to that of Z₄[X]/(X²), it is shown that weak central-vertex completeness is equivalent to the annihilator condition. Furthermore, a schema for describing zero-divisor graphs of radius 1 is provided.     

Sub-semigroups determined by the zero-divisor graph

In this paper we study sub-semigroups of a finite or an infinite zero-divisor semigroup S determined by properties of the zero-divisor graph Γ(S). We use these sub-semigroups to study the correspondence between zero-divisor semigroups and zero-divisor graphs. In particular, we discover a class of sub-semigroups of reduced semigroups and we study properties of sub-semigroups of finite or infinite semilattices with the least element. As an application, we provide a characterization of the graphs which are zero-divisor graphs of Boolean rings. We also study how local property of Γ(S) affects global property of the semigroup S, and we discover some interesting applications. In particular, we find that no finite or infinite two-star graph has a corresponding nil semigroup.     

Zero-Divisor Graphs of Matrices Over Commutative Rings

We investigate the properties of (directed) zero-divisor graphs of matrix rings. Then we use these results to discuss the relation between the diameter of the zero-divisor graph of a commutative ring R and that of the matrix ring M _n (R).     

The embedding of line graphs associated to the zero-divisor graphs of commutative rings

Let R be a commutative ring with identity and denote Γ(R) for its zero-divisor graph. In this paper, we study the minimal embedding of the line graph associated to Γ(R), denoted by L(Γ(R)), into compact surfaces (orientable or non-orientable) and completely classify all finite commutative rings R such that the line graphs associated to their zero-divisor graphs have genera or crosscaps up to two.     

每一个元素都是左零因子之环

本文引进左(右)零因子环的概念,它们是一类无单位元的环.我们称一个环为左(右)零因子环,如果对于任何 $a \in R$,都有$r_R (a) \neq 0~(l_R(a)\neq 0)$,而称一个环为强左(右)零因子环,如果$r_R(R)\neq 0~(l_R(R)\neq 0)$.Camillo和Nielson称一个环$R$为右有限零化环(简称RFA-环),如果$R$的每一个有限子集都有非零的右零化子.本文给出左零因子环的一些基本例子,探讨强左零因子环和RFA-环的扩张,并给出它们的等价刻画.     

Rings whose zero-divisor graphs have positive genus

It is shown that, for a fixed positive integer g, there are finitely many isomorphism classes of rings whose zero-divisor graph has genus g. The proof can then be modified to yield an analogous result for nonorientable genus.     

Commutative Rings R Whose C(𝔸𝔾(R)) Consist of Only Triangles

Let R be a commutative ring with identity. The set 𝕀(R) of all ideals of R is a bounded semiring with respect to ordinary addition, multiplication and inclusion of ideals. The zero-divisor graph of 𝕀(R) is called the annihilating-ideal graph of R, denoted by 𝔸𝔾(R). We write 𝒢 for the set of graphs whose cores consist of only triangles. In this paper, the types of the graphs in 𝒢 that can be realized as either the zero-divisor graphs of bounded semirings or the annihilating-ideal graphs of commutative rings are determined. A necessary and sufficient condition for a ring R such that 𝔸𝔾(R) ∈ 𝒢 is given. Finally, a complete characterization in terms of quotients of polynomial rings is established for finite rings R with 𝔸𝔾(R) ∈ 𝒢. Also, a connection between finite rings and their corresponding graphs is realized.     

On Realizing Zero-Divisor Graphs

An algorithm is presented for constructing the zero-divisor graph of a direct product of integral domains. Moreover, graphs which are realizable as zero-divisor graphs of direct products of integral domains are classified, as well as those of Boolean rings. In particular, graphs which are realizable as zero-divisor graphs of finite reduced commutative rings are classified.     

The Zero-Divisor Graphs Which Are Uniquely Determined By Neighborhoods

A nonempty simple connected graph G is called a uniquely determined graph, if distinct vertices of G have distinct neighborhoods. We prove that if R is a commutative ring, then Γ(R) is uniquely determined if and only if either R is a Boolean ring or T(R) is a local ring with x² = 0 for any x ∈ Z(R), where T(R) is the total quotient ring of R. We determine all the corresponding rings with characteristic p for any finite complete graph, and in particular, give all the corresponding rings of K_n if n + 1 = p^q for some primes p, q. Finally, we show that a graph G with more than two vertices has a unique corresponding zero-divisor semigroup if G is a zero-divisor graph of some Boolean ring.     

On commutative rings which are strongly prüfer

Abstract

As defined by Nicholson [Nicholson, W. K. (1977). Lifting idempotents and exchange rings. Trans. Amer. Math. Soc. 229:269–278] an element of a ring R is clean if it is the sum of a unit and an idempotent, and a subset A of R is clean if every element of A is clean. It is shown that a semiprimitive Gelfand ring R is clean if and only if Max(R) is zero-dimensional; if and only if for each M ∈ Max(R), the intersection all prime ideals contained in M is generated by a set of idempotents. We also give several equivalent conditions for clean functional rings. In fact, a functional ring R is clean if and only if the set of clean elements is closed under sum; if and only if every zero-divisor is clean; if and only if; R has a clean prime ideal.     

On the diameter and girth of a zero-divisor graph

For a commutative ring R with zero-divisors Z(R), the zero-divisor graph of R is Γ(R)=Z(R)−{0}, with distinct vertices x and y adjacent if and only if xy=0. In this paper, we characterize when either or . We then use these results to investigate the diameter and girth for the zero-divisor graphs of polynomial rings, power series rings, and idealizations.     

On the connectedness of the complement of the zero-divisor graph of a poset

Abstract

In this paper, connectedness is completely characterized for the complements of the zero-divisor graphs of partially ordered sets. These results are applied to annihilating ideal graphs and intersection graphs of submodules, generalizing some of the work that has recently appeared in the literature.     

Classification of Rings with Genus One Zero-Divisor Graphs

This paper investigates properties of the zero-divisor graph of a commutative ring and its genus. In particular, we determine all isomorphism classes of finite commutative rings with identity whose zero-divisor graph has genus one.     

Cut Vertices and Degree One Vertices of Zero-Divisor Graphs

This article continues to examine cut vertices in the zero-divisor graphs of commutative rings with 1. The main result is that, with only seven known exceptions, the zero-divisor graph of a commutative ring has a cut vertex if and only if the graph has a degree one vertex. This naturally leads to an examination of the degree one vertices of zero-divisor graphs.     

Zero-divisor graphs of idealizations

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 ring.