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 manuscript, the effect of substituting strontium with barium on the structural properties of Tl_0.8Ni_0.2Sr_2-xBr_xCa₂Cu₃O_9-δcompound with x= 0, 0.2, 0.4, have been studied. Samples were prepared using solid state reaction technique, suitable oxides alternatives of Pb₂O₃, CaO, BaO and CuO with 99.99% purity as raw materials and then mixed. They were prepared in the form of discs with a diameter of 1.5 cm and a thickness of (0.2-0.3) cm under pressures 7 tons / cm², and the samples were sintered at a constant temperature o

Contemporary arts have achieved, in accordance with the transition of concepts, a new logic in presentation and expression in general, and specifically in the field of ceramic art. The shift towards the logic of rejection and subversion of prevailing methods, which have been almost a constant foundation for a long period, has directly influenced the direction of visual arts in the contemporary world.
The growth and cultural transformations that the world has witnessed after the two World Wars have produced cognitive shifts based on strategies that diverge from the dominant culture. These approaches vary according to existential needs, as the language of art has become conceptual and a medium for contemporary culture with its rapid an

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

   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.

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

In this paper, we introduce and study the notion of the maximal ideal graph of a commutative ring with identity. Let R be a commutative ring with identity. The maximal ideal graph of R, denoted by MG(R), is the undirected graph with vertex set, the set of non-trivial ideals of R, where two vertices I₁ and I₂ are adjacent if I₁ I₂ and I₁+I₂ is a maximal ideal of R. We explore some of the properties and characterizations of the graph.

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