The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

In this paper we define and study new concepts of functions on fibrewise  topological spaces  over  B namely,  fibrewise  weakly  (resp., closure, strongly) continuoac; funttions which are analogous of weakly

(resp., closure,   strongly)   continuous  functions   and  the  main  result is   : Let  <p       : XY  be a fibrewise  closure  (resp.,  weakly,  closure, strongly,  strongly) continuous function,  where  Y  is fibrewise topological  space  over  B and  X  is  a  fibrewise set  which  has  the

in

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

The structure of this paper includes an introduction to the definition of the nano topological space, which was defined by M. L. Thivagar, who defined the lower approximation of G and the upper approximation of G, as well as defined the boundary region of G and some other important definitions that were mentioned in this paper with giving some theories on this subject. Some examples of defining nano perfect mappings are presented along with some basic theories. Also, some basic definitions were presented that form the focus of this paper, including the definition of nano  pseudometrizable space, the definition of nano compactly generated space, and the definition of completely nano para-compact. In this paper, we presented images of nan

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that

Luqman's story stated that human instinct, if I was brought up properly, reaches wisdom and inflicts the right to everything. It is to go to worship God and adhere to the satisfaction of morals and high morals that are ordered to meet among human beings in this life, because this worship educates in the soul the most beautiful morals needed by human beings of honesty, honesty and modesty, and the work of good and virtues, and distancing the soul from evil and vices.

The aim of the research is to design educational software based on Web Quests and to measure its effectiveness in developing information search skills of students at the Department of Educational and Psychological Sciences. The research is experimental in nature using pre-post measurement. The research sample consisted of (91) male and female students from the second grade in the Department of Educational and Psychological Sciences, they were divided into two equal groups; the experimental group consisted of (47) students who adopted the educational software as a studying method, and the control group consisted of (44) students who follow the traditional method. The researchers prepared a list of skills for searching information and they