The purpose of this paper is to study   new  types of open sets in bitopological spaces.    We shall introduce the concepts of  L- pre-open and L-semi-p-open sets

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

      In this work, the notion is defined by using    and some properties of this set are studied also,  and   Ù€ set are two concepts that are defined by using ; many examples have been cited to indicate that the reverse of the propositions and remarks is not achieved. In addition, new application example of nano was studied.

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

        In our research, we introduced new concepts, namely ^*and **-light mappings, after we knew ^*and **-totally disconnected mappings through the use of -open sets.

Many examples, facts, relationships and results have been given to support our work.

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.

A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.

   In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.
 

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