The notions Ǐ­semi­g­closedness and Ǐ­semi­g­openness were used to generalize and introduced new classes of separation axioms in ideal spaces. Many relations among several sorts of these classes are summarized, also.

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

The aim of this research is to prove the idea of maximum m_X-N-open set, m-N-extremally disconnected with respect to t and provide some definitions by utilizing the idea of m_X-N-open sets. Some properties of these sets are studied.

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 article, we introduce a new type of soft spaces namely, soft  spaces as   a generalization of soft paces. Also, we study the weak forms of soft  spaces, namely, soft  spaces, soft  spaces, soft  space, and soft  spaces. The characterizations and fundamental properties related to these types of soft spaces and the relationships among them are also discussed.

Astronomers have known since the invention of the telescope that atmospheric turbulence affects celestial images. So, in order to compensate for the atmospheric aberrations of the observed wavefront, an Adaptive Optics (AO) system has been introduced. The AO can be arranged into two systems: closedloop and open-loop systems. The aim of this paper is to model and compare the performance of both AO loop systems by using one of the most recent Adaptive Optics simulation tools, the Objected-Oriented Matlab Adaptive Optics (OOMAO). Then assess the performance of closed and open loop systems by their capabilities to compensate for wavefront aberrations and improve image quality, also their effect by the observed optical bands (near-infrared band

      This paper intends to initiate a new type of generalized closed set in topological space with the theoretical application of generalized topological space. This newly defined set is a weaker form than the -closed set as well as -closed set. Some phenomenal characterizations and results of newly defined sets are inculcated in a proper manner. The characteristics of normal spaces and regular spaces are achieved in the light of the generalized pre-regular closed set.

   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.
 

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.