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

Throughout this paper we study the properties of the composition operator
C
p1  o
p2  o…o
pn  induced by the composition of finite numbers of special
automorphisms of U,
pi  (z)  i
i
p z
1 p z


Such that pi  U, i  1, 2, …, n, and discuss the relation between the product of
finite numbers of automorphic composition operators on Hardy space H2 and some
classes of operators.

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 &

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

Ration power plants, to generate power, have become common worldwide. One such one is the steam power plant. In such plants, various moving parts of heavy machines generate a lot of noise. Operators are subjected to high levels of noise. High noise level exposure leads to psychological as well physiological problems; different kinds of ill effects. It results in deteriorated work efficiency, although the exact nature of work performance is still unknown. To predict work efficiency deterioration, neuro-fuzzy tools are being used in research. It has been established that a neuro-fuzzy computing system helps in identification and analysis of fuzzy models. The last decade has seen substantial growth in development of various neuro-fuzzy systems

 الأثر V بالنسبة إلى   sinshT و خواصه قد تم دراسته في هذا البحث حيث تم دراسة علاقة الأثر المخلص والاثر المنتهى التولد والاثر المنفصل وربطها بالمؤثرات المتباينة حيث تم بهنة العلاقات التالية ان الاثر اذا وفقط اذا مقاس في حالة كون المؤثر هو عديم القوة وكذلك في حالة كون المؤثر شامل فان الاثر هو منتهي التولد اي ان الغضاء هو منتهي التولد وايضا تم برهن ان الاثر مخلص لكل مؤثر مقيد وك\لك قد تم التحقق من انه لاي مؤثر مقي