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.

        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.

         Continuous functions are novel concepts in topology. Many topologists contributed to the theory of continuous functions in topology. The present authors continued the study on continuous functions by utilizing the concept of gpα-closed sets in topology and introduced the concepts of weakly, subweakly and almost continuous functions. Further, the properties of these functions are established.

In this paper we define a signal soft set as a mathematical tool to represent and study atoms, anti-atoms, electrons, anti-electrons, protons, and anti-protons, and generate a signal soft topology, with an example of signal soft topology on H₂O.

A -set in the projective line is a set of  projectively distinct points. From the fundamental theorem over the projective line, all -sets are projectively equivalent. In this research, the inequivalent -sets in have been computed and each -set classified to its -sets where  Also, the  has been splitting into two distinct -sets, equivalent and inequivalent.

The purpose of this paper is to give the condition under which every weakly closed
function is closed and to give the condition under which the concepts of weaklysemi
closed function and weakly pre-closed function are equivalent. Moreover,
characterizations and properties of weakly semi closed functions and weakly preclosed
function was given.

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 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

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

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