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.

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.

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

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

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.

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

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 purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

As the bit rate of fiber optic transmission systems is increased to more than , the system will suffer from an important random phenomena, which is called polarization mode dispersion. This phenomenon contributes effectively to: increasing pulse width, power decreasing, time jittering, and shape distortion. The time jittering means that the pulse center will shift to left or right. So that, time jittering leads to interference between neighboring pulses. On the other hand, increasing bit period will prevent the possibility of sending high rates. In this paper, an accurate mathematical analysis to increase the rates of transmission, which contain all physical random variables that contribute to determine the transmission rates, is presen