When the number of confirmed coronavirus disease cases rose in Iraq in the middle of February 2021, the Iraqi government performed a closure approach to constrain mobility and factory operations and enforce social distancing. In this research, the concentrations of air components (PM_2.5, PM₁₀, nitrogen dioxide (NO₂) and ozone (O₃)), which represent herein the degree of air quality index, were recorded, drawn and evaluated over central (Baghdad, the capital), northern (Kirkuk Province) and southern (Basra Province) Iraq before and during the closure. The experimental duration of this research was 6 months (from 1 January 2021 to 30 June 2021), which

This paper presents an investigation to the effect of the forming speed on healing voids that inhabit at various size in an ingot. The study was performed by using finite element method with bilinear isotropic material option, circular type voids were considered. The closure index was able to predict the minimum press force necessary to consolidate voids and the reduction. The simulation was carried out, on circular cross-section lead specials containing a central void of different size. At a time with a flat die, different ratio of inside to outside radius was taken with different speed to find the best result of void closure.

    In this paper , we study some approximation  properties of the strong difference and study the relation between the strong difference and the weighted modulus of continuity

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.

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 &

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

The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.