The regular graph of a commutative ring

Let R be a commutative ring, let Z(R) be the set of all zero-divisors of R and Reg(R) = R\Z(R). The regular graph of R, denoted by G(R), is a graph with all elements of Reg(R) as the vertices, and two distinct vertices x, y ∈ Reg(R) are adjacent if and only if x+y ∈ Z(R). In this paper we show that if R is a commutative Noetherian ring and 2 ∈ Z(R), then the chromatic number and the clique number of G(R) are the same and they are 2 ⁿ , where n is the minimum number of prime ideals whose union is Z(R). Also, we prove that all trees that can occur as the regular graph of a ring have at most two vertices.     

Zero-divisor graphs, von Neumann regular rings, and Boolean algebras

For a commutative ring R with set of 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 show that Γ(T(R)) and Γ(R) are isomorphic as graphs, where T(R) is the total quotient ring of R, and that Γ(R) is uniquely complemented if and only if either T(R) is von Neumann regular or Γ(R) is a star graph. We also investigate which cardinal numbers can arise as orders of equivalence classes (related to annihilator conditions) in a von Neumann regular ring.     

On the diameters of commuting graphs

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non-central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. Let D be a division ring and n ? 3. In this paper we investigate the diameters of Γ(M_n(D)) and determine the diameters of some induced subgraphs of Γ(M_n(D)), such as the induced subgraphs on the set of all non-scalar non-invertible, nilpotent, idempotent, and involution matrices in M_n(D). For every field F, it is shown that if Γ(M_n(F)) is a connected graph, then diam Γ(M_n(F)) ? 6. We conjecture that if Γ(M_n(F)) is a connected graph, then diam Γ(M_n(F)) ? 5. We show that if F is an algebraically closed field or n is a prime number and Γ(M_n(F)) is a connected graph, then diam Γ(M_n(F)) = 4. Finally, we present some applications to the structure of pairs of idempotents which may prove of independent interest.     

Eulerian graphs and automorphisms of a maximal graph

Let R be a commutative ring with identity. Let Γ(R) denote the maximal graph corresponding to the non-unit elements of R, i.e., Γ(R) is a graph with vertices the non-unit elements of R, where two distinct vertices a and b are adjacent if and only if there is a maximal ideal of R containing both. In this paper, we have shown that, for any finite ring R which is not a field, Γ(R) is a Euler graph if and only if R has odd cardinality. Moreover, for any finite ring R ? R ₁×R ₂× · · · ×R _n, where the R _i is a local ring of cardinality p _i ^αi for all i, and the p _i’s are distinct primes, it is shown that Aut(Γ(R)) is isomorphic to a finite direct product of symmetric groups. We have also proved that clique(G(R)’) = χ(G(R)’) for any semi-local ring R, where G(R)’ denote the comaximal graph associated to R.     

Some results on the annihilator graph of a commutative ring

Let R be a commutative ring. The annihilator graph of R, denoted by AG(R), is the undirected graph with all nonzero zero-divisors of R as vertex set, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y), where for z ∈ R, ann _R (z) = {r ∈ R: rz = 0}. In this paper, we characterize all finite commutative rings R with planar or outerplanar or ring-graph annihilator graphs. We characterize all finite commutative rings R whose annihilator graphs have clique number 1, 2 or 3. Also, we investigate some properties of the annihilator graph under the extension of R to polynomial rings and rings of fractions. For instance, we show that the graphs AG(R) and AG(T(R)) are isomorphic, where T(R) is the total quotient ring of R. Moreover, we investigate some properties of the annihilator graph of the ring of integers modulo n, where n ? 1.     

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.     

Energy of unitary Cayley graphs and gcd-graphs

This work is based on ideas of Ili? [A. Ili?, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881-1889] on the energy of unitary Cayley graph. For a finite commutative ring R with unity , the unitary Cayley graph of R is the Cayley graph whose vertex set is R and the edge set is {{a,b}:a,b∈Randa-b∈R^×}, where R^× is the group of units of R. We study the eigenvalues of the unitary Cayley graph of a finite commutative ring and some gcd-graphs and compute their energy. Moreover, we obtain the energy for the complement of unitary Cayley graphs.     

On directed zero-divisor graphs of finite rings

For an artinian ring R, the directed zero-divisor graph Γ(R) is connected if and only if there is no proper one-sided identity element in R. Sinks and sources are characterized and clarified for a finite ring R. Especially, it is proved that for any ring R, if there exists a source y in Γ(R) with y²=0, then |R|=4 and R={0,x,y,z}, where x and z are left identity elements and yx=0=yz. Such a ring R is also the only ring such that Γ(R) has exactly one source. This shows that Γ(R) cannot be a network for any finite or infinite ring R.     

The zero-divisor graph of a reduced ring

In this paper the zero-divisor graph Γ(R) of a commutative reduced ring R is studied. We associate the ring properties of R, the graph properties of Γ(R) and the topological properties of . Cycles in Γ(R) are investigated and an algebraic and a topological characterization is given for the graph Γ(R) to be triangulated or hypertriangulated. We show that the clique number of Γ(R), the cellularity of and the Goldie dimension of R coincide. We prove that when R has the annihilator condition and ; Γ(R) is complemented if and only if is compact. In a semiprimitive Gelfand ring, it turns out that the dominating number of Γ(R) is between the density and the weight of . We show that Γ(R) is not triangulated and the set of centers of Γ(R) is a dominating set if and only if the set of isolated points of is dense in .     

A semialgebraic closure for commutative algebra

Let A⊂R be rings containing the rationals. In R let S be a multiplicatively closed subset such that 1∈S and 0∉S, T a preorder of R (a proper subsemiring containing the squares) such that S⊂T and I an A-submodule of R. Define ρ(I) (or ρ_S,T(I)) to be

ρ(I)={a∈R|sa^2m+t∈I^2m for some m∈N,s∈S and t∈T}.     

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.     

Classification of rings with toroidal Jacobson graph

Let R be a commutative ring with nonzero identity and J(R) the Jacobson radical of R. The Jacobson graph of R, denoted by J_R, is defined as the graph with vertex set RJ(R) such that two distinct vertices x and y are adjacent if and only if 1 ? xy is not a unit of R. The genus of a simple graph G is the smallest nonnegative integer n such that G can be embedded into an orientable surface S_n. In this paper, we investigate the genus number of the compact Riemann surface in which J_R can be embedded and explicitly determine all finite commutative rings R (up to isomorphism) such that J_R is toroidal.     

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.     

Representations of matroids and free resolutions for multigraded modules

Let k be a field, let R=k[x₁,…,xm] be a polynomial ring with the standard Zm-grading (multigrading), let L be a Noetherian multigraded R-module, and let be a finite free multigraded presentation of L over R. Given a choice S of a multihomogeneous basis of E, we construct an explicit canonical finite free multigraded resolution T_•(Φ,S) of the R-module L. In the case of monomial ideals our construction recovers the Taylor resolution. A main ingredient of our work is a new linear algebra construction of independent interest, which produces from a representation ? over k of a matroid M a canonical finite complex of finite dimensional k-vector spaces T_•(?) that is a resolution of Ker?. We also show that the length of T_•(?) and the dimensions of its components are combinatorial invariants of the matroid M, and are independent of the representation map ?.     

Gorenstein injective, Gorenstein flat modules and the section functor

Let R be a commutative Noetherian ring of Krull dimension d, and let a be an ideal of R. In this paper, we will study the strong cotorsioness and the Gorenstein injectivity of the section functor Γ_a(−) in local cohomology. As applications, we will find new characterizations for Gorenstein and regular local rings. We also study the effect of the section functors Γ_a(−) and the functors on the Auslander and Bass classes.     

Commutative rings with genus two annihilator graphs

Let R be a commutative ring and Z(R)* be its set of all nonzero zero-divisors. The annihilator graph of a commutative ring R is the simple undirected graph AG(R) with vertices Z(R)*, and two distinct vertices x and y are adjacent if and only if ann(xy)≠ann(x)∪ann(y). The notion of annihilator graph has been introduced and studied by Badawi [8 Badawi, A. (2014). On the annihilator graph of a commutative ring. Commun. Algebra 42(1):108–121.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]. In this paper, we classify the finite commutative rings whose AG(R) are projective. Also we determine all isomorphism classes of finite commutative rings with identity whose AG(R) has genus two.     

Topology of dynamical systems in finite groups and number theory

We study and develop a very new object introduced by V.I. Arnold: a monad is a triple consisting of a finite set, a map from that finite set to itself and the monad graph which is the directed graph whose vertices are the elements of the finite set and whose arrows lead each vertex to its image (by the map). We consider the case in which the finite set entering in the monad definition is a finite group G and the map is the Frobenius map, for some k∈Z. We study the Frobenius dynamical system defined by the iteration of the monad fk, and also study the combinatorics and topology (i.e., the discrete invariants) of the monad graph. Our study provides useful information about several structures on the group associated to the monad graph. So, for example, several properties of the quadratic residues of finite commutative groups can be obtained in terms of the graph of the Frobenius monad .     

Local-edge-connectivity in digraphs and oriented graphs

A digraph without any cycle of length two is called an oriented graph. The local-edge-connectivityλ(u,v) of two vertices u and v in a digraph or graph D is the maximum number of edge-disjoint u-v paths in D, and the edge-connectivity of D is defined as . Clearly, λ(u,v)?min{d⁺(u),d^-(v)} for all pairs u and v of vertices in D. Let δ(D) be the minimum degree of D. We call a graph or digraph D maximally edge-connected when λ(D)=δ(D) and maximally local-edge-connected when

λ(u,v)=min{d⁺(u),d^-(v)}     

The unit graph of a left Artinian ring

Let R be a ring with non-zero identity and U(R) be the group of units of R. The unit graph of R, denoted by G(R), is a graph defined on the elements of R, and two distinct vertices r and s are adjacent if and only if r+s∈U(R). We investigate connectivity, diameter and the girth of the unit graph of a left Artinian ring. Also, by providing an algorithm, we determine when the unit graph of a finite ring is Hamiltonian.