In this paper, we shall introduce a new kind of Perfect (or proper) Mappings, namely ω-Perfect Mappings, which are strictly weaker than perfect mappings. And the following are the main results: (a) Let f : X→Y be ω-perfect mapping of a space X onto a space Y, then X is compact (Lindeloff), if Y is so. (b) Let f : X→Y be ω-perfect mapping of a regular space X onto a space Y. then X is paracompact (strongly paracompact), if Y is so paracompact (strongly paracompact). (c) Let X be a compact space and Y be a p*-space then the projection p : X×Y→Y is a ω-perfect mapping. Hence, X×Y is compact (paracompact, strongly paracompact) if and only if Y is so.

The purpose of this paper is to introduce a new type of compact spaces, namely semi-p-compact spaces which are stronger than compact spaces; we give properties and characterizations of semi-p-compact spaces.

In this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρg­regulαrity and Sρg­regulαrity. Many results and properties of both types have been investigated and have illustrated by examples.

   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 .
 

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.

This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra

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 notions Ǐ­semi­g­closedness and Ǐ­semi­g­openness were used to generalize and introduced new classes of separation axioms in ideal spaces. Many relations among several sorts of these classes are summarized, also.