In this paper, we introduce new classes of sets called g *sD -sets , g *sD −α -sets , g *spreD − sets , g *sbD − -sets and g *sD −β -sets . Also, we study some of their properties and relations among them . Moreover, we use these sets to define and study some associative separation axioms .
 

This paper considers a new Double Integral transform called Double Sumudu-Elzaki transform DSET. The combining of the DSET with a semi-analytical method, namely the variational iteration method DSETVIM, to arrive numerical solution of nonlinear PDEs of Fractional Order derivatives. The proposed dual method property decreases the number of calculations required, so combining these two methods leads to calculating the solution's speed. The suggested technique is tested on four problems. The results demonstrated that solving these types of equations using the DSETVIM was more advantageous and efficient

Most real-life situations need some sort of approximation to fit mathematical models. The beauty of using topology in approximation is achieved via obtaining approximation for qualitative subgraphs without coding or using assumption. The aim of this paper is to apply near concepts in the -closure approximation spaces. The basic notions of near approximations are introduced and sufficiently illustrated. Near approximations are considered as mathematical tools to modify the approximations of graphs. Moreover, proved results, examples, and counterexamples are provided.

Abstract

      Objective (s): To evaluate reasons for partial compliance and non-compliance to the

                              routine childhood vaccination schedule in Al-Karkh district 

Methodology: Descriptive study , using the evaluation approach, is carried throughout the present study to determine the reasons for the Routine Childhood Vaccination at  health care sectors and primary health care centers at  Al-Karkh District in Baghdad City, Convenient, non-probability, sample of (90) mother who are recruited from health care sectors at Al-Karkh District in Baghdad City. All mothers, who ha

The imbalances and economic problems which it face the countries, it is a result of international economic developments or changes or global crises such as deterioration in trade, sharp changes in oil prices, increasing global indebtedness, sharp changes in foreign exchange rates and other changes, all that, they affect the economic features of any country. and These influences vary from one country to another according to the rigidity of its economy and its potential in maneuvering with economic plans and actions that would reduce the impact or avoidance with minimal damage. Therefore, the countries  that  suffer from accumulated economic problems as a result of mismanagement and poor planning or suffe

            Semi-parametric regression models have been studied in a variety of applications and scientific fields due to their high flexibility in dealing with data that has problems, as they are characterized by the ease of interpretation of the parameter part while retaining the flexibility of the non-parametric part. The response variable or explanatory variables can have outliers, and the OLS approach have the sensitivity to outliers. To address this issue, robust (resistance) methods were used, which are less sensitive in the presence of outlier values in the data. This study aims to estimate the partial regression model using the robust estimation method with the wavel

In this work, we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied; j = , δ, α, pre, b, β

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi