In this paper, we proved that if R is a prime ring, U be a nonzero Lie ideal of R , d be a nonzero (?,?)-derivation of R. Then if Ua?Z(R) (or aU?Z(R)) for a?R, then either or U is commutative Also, we assumed that Uis a ring to prove that: (i) If Ua?Z(R) (or aU?Z(R)) for a?R, then either a=0 or U is commutative. (ii) If ad(U)=0 (or d(U)a=0) for a?R, then either a=0 or U is commutative. (iii) If d is a homomorphism on U such that ad(U) ?Z(R)(or d(U)a?Z(R), then a=0 or U is commutative.

Antibacterial substances belong to a group of compounds that attack dangerous microorganisms. Therefore, killing bacteria or reducing their metabolic activity will lessen their adverse effects on a biological system. They originated from either synthetic materials, microbes, or mold. Many of these medications treat the gram-negative bacteria from the critical precedence group, such as pseudomonas, carbapenem-resistant acinetobacter, and enterobacterales. This study aims to investigate the simultaneous analysis of specific antibacterial spectrophotometrically. The WHO maintains this list of priority infections with antibiotic resistance. Drug combinations in single dosage forms are becoming increasingly popular in the pharmaceutical industry

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

For any group G, we define G/H (read” G mod H”) to be the set of left cosets of H in G and this set forms a group under the operation (a)(bH) = abH. The character table of rational representations study to gain the K( SL(2,81)) and K( SL(2, 729)) in this work.

A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.