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.

    The objective of this paper is, firstly, we study a new concept noted by algebra and discuss the properties of this concept. Secondly, we introduce a new concept related to the algebra such as smallest algebra. Thirdly, we introduce the notion of the restriction of algebra on a nonempty subset  of and investigate some of its basic properties. Furthermore, we present the relationships between field, monotone class, field and algebra. Finally, we introduce the concept of measure relative to the algebra and prove that every measure relative to the   is complete.

This paper presents results about the existence of best approximations via nonexpansive type maps defined on modular spaces. 

      Strong and ∆-convergence for a two-step iteration process utilizing asymptotically nonexpansive and total asymptotically nonexpansive noneslf mappings in the CAT(0) spaces have been studied. As well, several strong convergence theorems under semi-compact and condition (M) have been proved. Our results improve and extend numerous familiar results from the existing literature.

The goal of this article is to construct fibrewise w-compact (resp. locally w-compact) spaces. Some related results and properties of these concepts will be investigated. Furthermore, we investigate various relationships between these concepts and three classes of fibrewise w-separation axioms.

This paper introduces a generalization sequence of positive and linear operators of integral type based on two parameters to improve the order of approximation. First, the simultaneous approximation is studied and a Voronovskaja-type asymptotic formula is introduced. Next, an error of the estimation in the simultaneous approximation is found. Finally, a numerical example to approximate a test function and its first derivative of this function is given for some values of the parameters. 

Promoting the production of industrially important aromatic chloroamines over transition-metal nitrides catalysts has emerged as a prominent theme in catalysis. This contribution provides an insight into the reduction mechanism of p-chloronitrobenzene (p-CNB) to p-chloroaniline (p-CAN) over the γ-Mo2N(111) surface by means of density functional theory calculations. The adsorption energies of various molecularly adsorbed modes of p-CNB were computed. Our findings display that, p-CNB prefers to be adsorbed over two distinct adsorption sites, namely, Mo-hollow face-centered cubic (fcc) and N-hollow hexagonal close-packed (hcp) sites with adsorption energies of −32.1 and −38.5 kcal/mol, respectively. We establish that the activation of nit

The activity ·of adenosine dcaminase enzyn1e· has  been  investigated in   normal  and   thalassaemic  sera.  The  data  obtaiJ1ed were   refl  cts   an elevation  of' the  enzyme   ctivity in thalassaemic samples compared with those  of  healthy  normal objects. The  study  was  carried  out  with  (6.5)PH value  and  37C   as ma.x.Lmum  temperature. This  study  was comprehensive to the electrophopretic behavior of the hemolysate serum   in a step  of electrophoresis analysis of the thalassaemic-and normal  hemoglobin.

     The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and  if   as well as if   .

  For the second step of the work, the estimatio