Sharif Digital Repository

In this paper we study the probability that the commutator of two randomly chosen elements in a finite group is equal to a given element of that group. Explicit computations are obtained for groups G which | G′ | is prime and G′ ≤ Z (G) as well as for groups G which | G′ | is prime and G′ ∩ Z (G) = 1. This paper extends results of Rusin [see D.J. Rusin, What is the probability that two elements of a finite group commute? Pacific J. Math. 82 (1) (1979) 237-247]. © 2007 Elsevier Ltd. All rights reserved  

In this note, we show that under certain assumptions the matrix Riccati differential equation X′ = A(t)X + XB(t)X + C(t) with periodic coeffi cients admits at least one periodic solution. Also, we give an illustrative example in order to indicate the validity of the assumptions and the novelty of our result. © 2021, Tsing Hua University. All rights reserved  

For a given finite commutative ring R with 1≠0, one may associate a graph which is called the total graph of R and it is denoted by T(R). This graph has R as the vertex set and its two distinct vertices x and y are adjacent exactly whenever x+y is a zero-divisor of R. In this note, we prove that T(R) is well-covered if and only if either R is local or 2 is a zero-divisor. © 2021 Elsevier GmbH  

Let R be a finite commutative ring with nonzero identity. The unit graph of R is the graph in which the vertex set is R, and two distinct vertices x and y are adjacent if and only if x + y is a unit in R. In this paper, we determine when these graphs are well-covered, and then, by applying this result, we characterize the unit graphs whose edge rings are Cohen–Macaulay (Gorenstein). This characterization gives us a large class of non-Cohen–Macaulay graphs. © 2022 Taylor & Francis Group, LLC  

For a given finite commutative ring R with 1a0, one may associate a graph which is called the total graph of R. This graph has R as the vertex set and its two distinct vertices x and y are adjacent exactly whenever x + y is a zero-divisor of R. In this paper, we give necessary and sufficient conditions for two classes of total graphs to be Cohen-Macaulay. © 2023 World Scientific Publishing Company  

In this paper, we characterize complete partite zero-divisor graphs of posets via the ideals of the posets. In particular, for complete bipartite zero-divisor graphs, we give a characterization based on the prime ideals of the posets  

Let R be a finite commutative ring with nonzero identity. The unit graph of R is the graph obtained by setting all the elements of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if x + y is a unit ele¬ment of R. In this paper, a classification of finite commutative rings with nonzero identity in which their unit graphs have domination number less than four is given  

Let R be a ring with nonzero identity. The unit graph of R, denoted by G(R), has its set of vertices equal to the set of all elements of R; distinct vertices x and y are adjacent if and only if x + y is a unit of R. In this article, the basic properties of G(R) are investigated and some characterization results regarding connectedness, chromatic index, diameter, girth, and planarity of G(R)are given. (These terms are defined in Definitions and Remarks 4.1, 5.1, 5.3, 5.9, and 5.13.)  

Let R be a finite commutative ring with nonzero identity and denote its Jacobson radical by J(R). The Jacobson graph of R is the graph in which the vertex set is RJ(R), and two distinct vertices x and y are adjacent if and only if 1-xy is not a unit in R. In this paper, the nonorientable genus of some Jacobson graphs is either computed or estimated by a lower bound. As an application, the rings R with projective Jacobson graphs are classified  

Let R be a finite commutative ring with nonzero identity and denote its Jacobson radical by J(R). The Jacobson graph of R is the graph in which the vertex set is R J(R) , and two distinct vertices x and y are adjacent if and only if 1 - xy is not a unit in R. In this paper, up to isomorphism, we classify the rings R whose Jacobson graphs are toroidal. © 2016, Malaysian Mathematical Sciences Society and Universiti Sains Malaysia  

The unit graph of a ring R with nonzero identity is the graph in which the vertex set is R, and two distinct vertices x and y are adjacent if and only if x + y is a unit in R. In this paper, we derive several necessary conditions for the nonplanarity of the unit graphs of finite commutative rings with nonzero identity, and determine, up to isomorphism, all finite commutative rings with nonzero identity whose unit graphs are toroidal  

Let n be a positive integer and let Sn be the set of all nonnegative integers less than n which are relatively prime to n. In this paper, we discuss structural properties of circulant graphs generated by the Sn′s and their complements. In particular, we characterize when these graphs are well-covered, Cohen–Macaulay, Buchsbaum or Gorenstein. © 2020, Springer Science+Business Media, LLC, part of Springer Nature  

Let n be a positive integer and let Sn be the set of all nonnegative integers less than n which are relatively prime to n. In this paper, we discuss structural properties of circulant graphs generated by the Sn’s and their complements. In particular, we characterize when these graphs are well-covered, Cohen–Macaulay, Buchsbaum or Gorenstein. © 2020, Springer Science+Business Media, LLC, part of Springer Nature  

Let π be an even permutation on n letters which has a root, that is, there exists an even permutation such that π = 2. In this article the number of this kind of π is found by using generating function techniques. This is the analogue of a result for the number of all permutations with roots  

In this article using techniques which appeared in Witt's proof of Wedderburn's theorem, an arithmetical characterisation of groups acting on a set whose orbits are all singleton is given. This can then be used to obtain a new proof of Wedderburn's theorem. Copyright Clearance Centre, Inc  

Let n≥2 be an integer. The graph G(n) is obtained by letting all the elements of {0,…,n−1} to be the vertices and defining distinct vertices x and y to be adjacent if and only if gcd⁡(x+y,n)=1. In this paper, well-coveredness, Cohen–Macaulayness, vertex-decomposability and Gorensteinness of these graphs and their complements are characterized. These characterizations provide large classes of Cohen–Macaulay and non Cohen–Macaulay graphs. © 2021 Elsevier B.V  

Let R be a finite commutative ring with nonzero identity. The unitary Cayley graph of R is the graph obtained by letting all the elements of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if x–y is a unit element of R. In this paper, we characterize all unitary Cayley graphs with Roman domination number at most four. © 2022 The Author(s). Published with license by Taylor & Francis Group, LLC  

In this paper, we deal with zero-divisor graphs of posets. We prove that the diameter of such a graph is either 1, 2 or 3 while its girth is either 3, 4 or ∞. We also characterize zero-divisor graphs of posets in terms of their diameter and girth  

In this work the second-order generalized forced Li ́enard equationx′′+(f(x)+k(x)x′)x′+g(x)=p(t)is considered and anew condition for guaranteeing the existence of at least one periodic solution for this equation is given  

A classical question of Yoneda asks when the tensor product of two injective modules is injective. A complete answer to this question was given by Enochs and Jenda in 1991. In this paper the analogue question for pure-injective modules is studied