Let M be a prime Γ-ring satisfying abc  abc for all a,b,cM and
,  with center Z, and U be a Lie (Jordan) ideal. A mapping d :M M
is called Γ- centralizing if u d u Z  [ , ( )] for all uU and  .In this paper
, we studied Lie and Jordan ideal in a prime Γ - ring M together with Γ -
centralizing derivations on U.

         In the present paper, the authors introduce and investigates two new subclasses and,  of the class k-fold bi-univalent functions in the open unit disk. The initial coefficients for all of the functions that belong to them were determined, as well as the coefficients for functions that belong to a field determining these coefficients requires a complicated process. The bounds for the initial coefficients and are contained among the remaining results in our analysis are obtained. In addition, some specific special improver results for the related classes are provided.

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

The purpose of this paper is to give the condition under which every weakly closed
function is closed and to give the condition under which the concepts of weaklysemi
closed function and weakly pre-closed function are equivalent. Moreover,
characterizations and properties of weakly semi closed functions and weakly preclosed
function was given.

The study of properties of space of entire functions of several complex variables was initiated by Kamthan [4] using the topological properties of the space. We have introduced in this paper the sub-space of space of entire functions of several complex variables which is studied by Kamthan.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &

Introduction to Medical Physics for Pharmacy Students and Medical Groups - ISBNiraq.org