Some Remarks on the Graph Γ I (R)

Let R be a commutative ring with nonzero identity and Z(R) its set of zero-divisors. The zero-divisor graph of R is Γ(R), with vertices Z(R)?{0} and distinct vertices x and y are adjacent if and only if xy = 0. For a proper ideal I of R, the ideal-based zero-divisor graph of R is Γ _I (R), with vertices {x ∈ R?I | xy ∈ I for some y ∈ R?I} and distinct vertices x and y are adjacent if and only if xy ∈ I. In this article, we study the relationship between the two graphs Γ(R) and Γ _I (R). We also determine when Γ _I (R) is either a complete graph or a complete bipartite graph and investigate when Γ _I (R) ? Γ(S) for some commutative ring S.     

On the Annihilator Graph of a Commutative Ring

Let R be a commutative ring with nonzero identity, Z(R) be its set of zero-divisors, and if a ∈ Z(R), then let ann _R (a) = {d ∈ R | da = 0}. The annihilator graph of R is the (undirected) graph AG(R) with vertices Z(R)* = Z(R)?{0}, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y). It follows that each edge (path) of the zero-divisor graph Γ(R) is an edge (path) of AG(R). In this article, we study the graph AG(R). For a commutative ring R, we show that AG(R) is connected with diameter at most two and with girth at most four provided that AG(R) has a cycle. Among other things, for a reduced commutative ring R, we show that the annihilator graph AG(R) is identical to the zero-divisor graph Γ(R) if and only if R has exactly two minimal prime ideals.     

Zero-Divisor Graph with Respect to an Ideal

ABSTRACT

Let R be a commutative ring with nonzero identity and let I be an ideal of R. The zero-divisor graph of R with respect to I, denoted by Γ _I (R), is the graph whose vertices are the set {x ? R\I | xy ? I for some y ? R\I} with distinct vertices x and y adjacent if and only if xy ? I. In the case I = 0, Γ₀(R), denoted by Γ(R), is the zero-divisor graph which has well known results in the literature. In this article we explore the relationship between Γ _I (R) ? Γ _J (S) and Γ(R/I) ? Γ(S/J). We also discuss when Γ _I (R) is bipartite. Finally we give some results on the subgraphs and the parameters of Γ _I (R).     

Central Sets and Radii of the Zero-Divisor Graphs of Commutative Rings

For a commutative ring R with identity, the zero-divisor graph, Γ(R), is the graph with vertices the nonzero zero-divisors of R and edges between distinct vertices x and y whenever xy = 0. This article gives a proof that the radius of Γ(R) is 0, 1, or 2 if R is Noetherian. The center union {0} is shown to be a union of annihilator ideals if R is Artinian. The diameter of Γ(R) can be determined once the center is identified. If R is finite, then the median is shown to be a subset of the center. A dominating set of Γ(R) is constructed using elements of the center when R is Artinian. It is shown that for a finite ring R ? ?₂ × F for some finite field F, the domination number of Γ(R) is equal to the number of distinct maximal ideals of R. Other results on the structure of Γ(R) are also presented.     

Annihilator Ideal-Based Zero-Divisor Graphs Over Multiplication Modules

For a commutative ring R with identity, an ideal-based zero-divisor graph, denoted by Γ _I (R), is the graph whose vertices are {x ∈ R?I | xy ∈ I for some y ∈ R?I}, and two distinct vertices x and y are adjacent if and only if xy ∈ I. In this article, we investigate an annihilator ideal-based zero-divisor graph by replacing the ideal I with the annihilator ideal Ann(M) for a multiplication R-module M. Based on the above-mentioned definition, we examine some properties of an R-module over a von Neumann regular ring, and the cardinality of an R-module associated with Γ _Ann(M)(R).     

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.     

On the Zero-Divisor Graph of a Ring

Let R be a commutative ring with identity, Z(R) its set of zero-divisors, and Nil(R) its ideal of nilpotent elements. 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 article, we study Γ(R) for rings R with nonzero zero-divisors which satisfy certain divisibility conditions between elements of R or comparability conditions between ideals or prime ideals of R. These rings include chained rings, rings R whose prime ideals contained in Z(R) are linearly ordered, and rings R such that {0} ≠ Nil(R) ? zR for all z ∈ Z(R)\Nil(R).     

Commutative Rings Whose Cozero-Divisor Graphs are Unicyclic or of Bounded Degree

Let R be a commutative ring with unity. The cozero-divisor graph of R, denoted by Γ′(R), is a graph with vertex set W*(R), where W*(R) is the set of all nonzero and nonunit elements of R, and two distinct vertices a and b are adjacent if and only if a ? Rb and b ? Ra, where Rc is the ideal generated by the element c in R. Recently, it has been proved that for every nonlocal finite ring R, Γ′(R) is a unicyclic graph if and only if R ? ?₂ × ?₄, ?₃ × ?₃, ?₂ × ?₂[x]/(x ²). We generalize the aforementioned result by showing that for every commutative ring R, Γ′(R) is a unicyclic graph if and only if R ? ?₂ × ?₄, ?₃ × ?₃, ?₂ × ?₂[x]/(x ²), ?₂[x, y]/(x, y)², ?₄[x]/(2x, x ²). We prove that for every positive integer Δ, the set of all commutative nonlocal rings with maximum degree at most Δ is finite. Also, we classify all rings whose cozero-divisor graph has maximum degree 3. Among other results, it is shown that for every commutative ring R, gr(Γ′(R)) ∈ {3, 4, ∞}.     

Smarandache Vertices of the Graphs Associated to the Commutative Rings

Let R be a commutative ring with identity 1 ≠ 0. A nonzero element a in R is said to be a Smarandache zero-divisor if there exist three different nonzero elements x, y, and b (≠ a) in R such that ax = ab = by = 0, but xy ≠ 0. We will generalize this notion to the Smarandache vertex of an arbitrary simple graph and characterize the Smarandache zero-divisors of commutative rings (resp. with respect to an ideal) via their associated zero-divisor graphs. We illustrate them with examples and prove some interesting results about them.     

Commuting Graphs of Matrix Algebras

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all noncentral elements of R, and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this article we investigate some graph-theoretic properties of Γ(M _n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL _n (F) and SL _n (F). We show that Γ(M _n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL _n (F)) and Γ(SL _n (F)). Also we show that for two fields F and E and integers n, m ≥ 2, if Γ(M _n (F))?Γ(M _m (E)), then n = m and |F|=|E|.     

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 Commuting Graphs of Finite Matrix Rings

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all noncentral elements of R and two distinct vertices are joint by an edge whenever they commute. It is conjectured that if R is a ring with identity such that Γ(R) ≈ Γ(M _n (F)), for a finite field F and n ≥ 2, then R ≈ M _n (F). Here we prove this conjecture when n = 2.     

Dominating Sets of Some Graphs Associated to Commutative Rings

Let G = (V, E) be a graph. A set S ? V is a dominating set of G if every vertex in V is either in S or is adjacent to a vertex in S. The domination number γ(G) of G is the minimum cardinality among the dominating sets of G. The main object of this article is to study and characterize the dominating sets of the zero-divisor graph Γ(R) and ideal-based zero-divisor graph Γ _I (R) of a commutative ring R.     

Commuting graphs of groups and related numerical parameters

Given a finite group G, we denote by Δ(G) the commuting graph of G which is defined as follows: the vertex set is G and two distinct vertices x and y are joined by an edge if and only if xy = yx. Clearly, Δ(G) is always connected for any group G. We denote by κ(G) the number of spanning trees of Δ(G). In the present paper, among other results, we first obtain the value κ(G) for some specific groups G, such as Frobenius groups, Dihedral groups, AC-groups, etc. Next, we characterize the alternating group A₅, in the class of nonsolvable groups through its tree-number κ(A₅). Finally, we classify the finite groups for which the power graph and the commuting graph coincide.     

A New Characterization of A 10 by its Noncommuting Graph

Let G be a nonabelian group and associate a noncommuting graph ?(G) with G as follows: The vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In 1987, Professor J. G. Thompson gave the following conjecture.

Thompson's Conjecture. If G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying N(G) = N(M), then G ? M, where N(G):={n ∈ ? | G has a conjugacy class of size n}.

In 2006, A. Abdollahi, S. Akbari, and H. R. Maimani put forward a conjecture (AAM's conjecture) in Abdollahi et al. (2006) as follows.

AAM's Conjecture. Let M be a finite nonabelian simple group and G a group such that ?(G) ? ? (M). Then G ? M.

In this short article we prove that if G is a finite group with ?(G) ? ? (A ₁₀), then G ? A ₁₀, where A ₁₀ is the alternating group of degree 10.     

A New Construction for Cohen–Macaulay Graphs

Let G be a finite simple graph on a vertex set V(G) = {x ₁₁,…, x _n1}. Also let m ₁,…, m _n  ≥ 2 be integers and G ₁,…, G _n be connected simple graphs on the vertex sets V(G _i ) = {x _i1,…, x _{im i} }. In this article, we provide necessary and sufficient conditions on G ₁,…, G _n for which the graph obtained by attaching the G _i to G is unmixed or vertex decomposable. Then we characterize Cohen–Macaulay and sequentially Cohen–Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to arbitrary graphs.     

Zero-Divisor Semigroups and Some Simple Graphs

In this article, we study commutative zero-divisor semigroups determined by graphs. We prove that for all n ≥ 4, the complete graph K _n together with two end vertices has a unique corresponding zero-divisor semigroup, while the complete graph K _n together with three end vertices has no corresponding semigroups. We determine all the twenty zero-divisor semigroups whose zero-divisor graphs are the complete graph K ₃ together with an end vertex.     

Commuting Graphs of Group Algebras

The commuting graph of a ring R, denoted by Γ(R), is a graph of all whose vertices are noncentral elements of R, and 2 distinct vertices x and y are adjacent if and only if xy = yx. In this article we investigate some graph-theoretic properties of Γ(kG), where G is a finite group, k is a field, and 0 ≠ |G| ∈k. Among other results it is shown that if G is a finite nonabelian group and k is an algebraically closed field, then Γ(kG) is not connected if and only if |G| = 6 or 8. For an arbitrary field k, we prove that Γ(kG) is connected if G is a nonabelian finite simple group or G′ ≠ G″ and G″ ≠ 1.     

When is the Comaximal Graph Split?

Let R be a commutative ring with non zero unity. Let Ω(R) be a graph with vertices as elements of R whose two distinct vertices x and y are adjacent if and only if Rx + Ry = R. A graph (V, E) is said to be a split graph if V is the disjoint union of two sets K and S where K induces a complete subgraph and S is an independent set. We investigate the properties of R when Ω(R) is split.     

The Semilattice of Annihilator Classes in a Reduced Commutative Ring

Let R be a reduced commutative ring with 1 ≠ 0. Let R _E be the set of equivalence classes for the equivalence relation on R given by x ～ y if and only if ann _R (x) = ann _R (y). Then R _E is a (meet) semilattice with respect to the order [x] ≤ [y] if and only if ann _R (y) ? ann _R (x). In this paper, we investigate when R _E is a lattice and relate this to when R is weakly complemented or satisfies the annihilator condition. We also consider when R is a (meet) semilattice with respect to the Abian order defined by x ≤ y if and only if xy = x ².