Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.

 In this paper, we introduce  and  study  new  classes of soft  open  sets  in soft bitopological spaces called soft  (1,2)*-omega  open  sets  and  weak forms of soft (1,2)*-omega open sets such as soft  (1,2)*-α-ω-open sets, soft  (1,2)*-pre-ω-opensets, soft  (1,2)*-b-ω-open sets,  and  soft  (1,2)*-β-ω-open  sets. Moreover; some basic properties and the relation among these concepts and other concepts also have been studied.

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

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

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

In this paper we give many connections between essentially quasi-Dedekind (quasi-
Dedekind) modules and other modules such that Baer modules, retractable modules,
essentially retractable modules, compressible modules and essentially compressible
modules where an R-module M is called essentially quasi-Dedekind (resp. quasi-
Dedekind) if, Hom(M N ,M )  0 for all N ≤e M (resp. N ≤ M). Equivalently, a
module M is essentially quasi-Dedekind (resp. quasi-Dedekind) if, for each
f End (M) R  , Kerf ≤ e M implies f = 0 (resp. f  0 implies ker f  0 ).

    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.

A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element. Also shows the relationship between the Jacobsen Radical, and the set of invertible elements and gets some results, and linked these results with the divisible hyperring. After going through the concept of divisible hypermodule that presented 2017, later in 2022, the concept of the divisible hyperring will be related to the concept of division hyperring, where each division hyperring is divisible and the converse is achieved under conditions that will be explained in the theorem 3.14. At the end of this paper, it will be clear that the goal of this paper is to study the concept