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 discuss the Zariski topology of intuitionistic fuzzy d-filter in d-algebra, with some topological properties on the spectrum of intuitionistic fuzzy d-filter in d-algebra X which have algebraic features such as connectedness. We find that this topology is a strongly connected, and  T₀ space. We also define the invariant map on intuitionistic fuzzy prime d-filter with a homomorphism map.

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.

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.

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.

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

The platforms of social networking sites, with their distinctive communication and technological features, create a social movement that led to the establishment of a new pattern of communication in a modern context. This allows the users on the internet to carry out many social interactions based on the interests and commonalities among them. Algerian women have a share of this digital presence by representing their views and discussing their issues on several sites like Facebook, for example.
In this research, we have analyzed the pages of Algerian women on Facebook site to find out the most important issues addressed by Algerian women so that we can organize their concerns in the digital channels and discover their different orie

The significance of the work is to introduce the new class of open sets, which is said Ǥ- -open set with some of properties. Then clarify how to calculate the boundary area for these sets using the upper and lower approximation and obtain the best accuracy.

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