In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.

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.

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

          Remote sensing and GIS applications (Geoinformatics tools) involve a wide range of techniques for providing a solution for future water resources management and offer an excellent means to improve knowledge of sustainable planning. Al-Razzaza is the second largest lake in Iraq; it is a common source of fishery fortune and floodwater reservoir in southwestern Iraq. In recent years, the lake faced a noticeable amount of desiccation, which is considered a threat to the biodiversity and wildlife of the lake. The study aimed to detect the Lake's spatiotemporal changes from 1988 to 2018. Multi satellite-derived indices were investigated for the extracting of the lake water body. Results showed that the lake volume decrea

         Let  be any group with identity element (e) . A subgroup intersection graph of  a subset  is the Graph with V ( ) =  - e and two separate peaks c and d contiguous for c and d if and only if      , Where  is a Periodic subset of resulting from  . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of   , where    ,  is aprime number.

   In this paper we give definitions, properties and examples of the notion of  type Ntopological space. Throughout this paper  N is a finite positive  number, N 2. The task of this paper is to study and investigate some properties of such spaces with the existence of a relation between this space and artificial Neural Networks (NN'S), that is we applied the definition of this space in computer field and specially in parallel processing

Synthesis of a new class of Schiff-base ligand with a tetrazole moiety to form polymeric metal complexes with Co^II, Ni^II, Zn^II, and Cd^II ions has been demonstrated. The ligand was synthesised by a multi-steps by treating 5-amino-2-chlorobenzonitrile and cyclohexane -1,3-dione, the 5,5'-(((1E,3E)-cyclohexane-1,3-diylidene)bis(azanylylidene))bis(2-chlorobenzonitrile) was obtained. The precursor (M) was prepared  from the reaction 5,5'-(((1E,3E)-cyclohexane-1,3-diylidene)bis(azanylylidene))bis(2-chlorobenzonitrile) with NaN₃ to obtained (1E,3E)-N¹,N³-bis(4-chloro-3-(1H-tetrazol-5-yl)phenyl)cyclohexane-1,3-diimine (N). By reacting the precursor (M) with CS₂

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

الكلمات المشتقة من الاعداد