Tetravalent Edge-transitive Cayley Graphs of PGL （2, p）

t Let F = Cay（G, S）, R（G） be the right regular representation of G. The graph Г is called normal with respect to G, if R（G） is normal in the full automorphism group Aut（F） of F. Г is called a bi-normal with respect to G if R（G） is not normal in Aut（Г）, but R（G） contains a subgroup of index 2 which is normal in Aut（F）. In this paper, we prove that connected tetravalent edge-transitive Cayley graphs on PGL（2,p） are either normal or bi-normal when p ≠ 11 is a prime.     

Noncyclic Graph of a Group

We associate a graph Γ _G to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ? G| 〈x, y〉 is cyclic for all y ? G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of Γ _G is finite if and only if Γ _G has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with Γ _G  ? Γ _H and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if Γ _G  ? Γ _H for some group H, then G ? H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if Γ _G  ? Γ _H for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.     

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

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

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.     

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, ∞}.     

Heptavalent Symmetric Graphs with Certain Conditions

A graph Γ is said to be symmetric if its automorphism group Aut(Γ)acts transitively on the arc set of Γ.We show that if Γ is a finite connected heptavalent symmetric graph with solvable stabilizer admitting a vertex-transitive non-abelian simple group G of automorphisms,then either G is normal in Aut(Γ),or Aut(Γ)contains a non-abelian simple normal subgroup T such that G≤T and(G,T)is explicitly given as one of 11 possible exceptional pairs of non-abelian simple groups.If G is arc-transitive,then G is always normal in Aut(r),and if G is regular on the vertices of Γ,then the number of possible exceptional pairs(G,T)is reduced to 5.     

On the Genus of the Nilpotent Graphs of Finite Groups

The nilpotent graph of a group G is a simple graph whose vertex set is G?nil(G), where nil(G) = {y ∈ G | ? x, y ? is nilpotent ? x ∈ G}, and two distinct vertices x and y are adjacent if ? x, y ? is nilpotent. In this article, we show that the collection of finite non-nilpotent groups whose nilpotent graphs have the same genus is finite, derive explicit formulas for the genus of the nilpotent graphs of some well-known classes of finite non-nilpotent groups, and determine all finite non-nilpotent groups whose nilpotent graphs are planar or toroidal.     

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.     

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.     

Alternating Sign Multibump Solutions of Nonlinear Elliptic Equations in Expanding Tubular Domains

Let Γ denote a smooth simple curve in ? ^N , N ≥ 2, possibly with boundary. Let Ω _R be the open normal tubular neighborhood of radius 1 of the expanded curve RΓ: = {Rx | x ∈ Γ??Γ}. Consider the superlinear problem ? Δu + λu = f(u) on the domains Ω _R , as R → ∞, with homogeneous Dirichlet boundary condition. We prove the existence of multibump solutions with bumps lined up along RΓ with alternating signs. The function f is superlinear at 0 and at ∞, but it is not assumed to be odd. If the boundary of the curve is nonempty our results give examples of contractible domains in which the problem has multiple sign changing solutions.     

On the Dot Product Graph of a Commutative Ring

Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × … ×A (n times). The total dot product graph of R is the (undirected) graph TD(R) with vertices R* = R?{(0, 0,…, 0)}, and two distinct vertices x and y are adjacent if and only if x·y = 0 ∈ A (where x·y denote the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R)* = Z(R)?{(0, 0,…, 0)}. It follows that each edge (path) of the classical zero-divisor graph Γ(R) is an edge (path) of ZD(R). We observe that if n = 1, then TD(R) is a disconnected graph and ZD(R) is identical to the well-known zero-divisor graph of R in the sense of Beck–Anderson–Livingston, and hence it is connected. In this paper, we study both graphs TD(R) and ZD(R). For a commutative ring A and n ≥ 3, we show that TD(R) (ZD(R)) is connected with diameter two (at most three) and with girth three. Among other things, for n ≥ 2, we show that ZD(R) is identical to the zero-divisor graph of R if and only if either n = 2 and A is an integral domain or R is ring-isomorphic to ?₂ × ?₂ × ?₂.     

A Class of Auslander-Regular Macaulay Rings

Abstract

For a (left and right) noetherian semilocal ring R we analyse a regularity concept (called weak regularity) based on the equation gld R = dim R. Examples are regular Cohen-Macaulay orders over a regular local ring, localized enveloping algebras of finite dimensional Lie algebras, and the regular rings classified in Rump (2001b). We prove that weakly regular rings are Auslander-regular and Macaulay.     

End-regularity of zero-divisor graphs of group rings

A graph Γ is said to be End-regular if its endomorphism monoid End(Γ) is regular. D. Lu and T. Wu [25 Lu, D., Wu, T. (2008). On endomorphism-regularity of zero-divisor graphs. Discrete Math. 308:4811–4815.[Crossref], [Web of Science ®] , [Google Scholar]] posed an open problem: Given a ring R, when does the zero-divisor graph Γ(R) have a regular endomorphism monoid? and they solved the problem for R a commutative ring with at least one nontrivial idempotent. In this paper, we solve this problem for zero-divisor graphs of group rings.     

On the Commuting Graph of Dihedral Group

Let Γ be a non-abelian group and Ω ? Γ. We define the commuting graph G = 𝒞(Γ, Ω) with vertex set Ω and two distinct elements of Ω are joined by an edge when they commute in Γ. In this article, among some properties of commuting graphs, we investigate distant properties as well as detour distant properties of commuting graph on D_2n. We also study the metric dimension of commuting graph on D_2n and compute its resolving polynomial.     

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.     

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.     

Non-Nilpotent Graph of a Group

We associate a graph 𝒩 _G with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this article, we study the graph theoretical properties of 𝒩 _G and its induced subgraph on G \ nil(G), where nil(G) = {x ∈ G | ? x, y ? is nilpotent for all y ∈ G}. For any finite group G, we prove that 𝒩 _G has either |Z*(G)| or |Z*(G)| +1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact, we prove that a finite group G is nilpotent if and only if the set of vertex degrees of 𝒩 _G has at most two elements.