The topic of supra.topological.spaces considered one of the important topics because it is a generalization to topological.spaces. Many researchers have presented generalizations to supra open sets such as supra semi.open and supra pre.open sets and others. In this paper, the concept of δ∼open sets was employed and introduced in to the concept of supra topology and a new type of open set was extracted, which was named S∼δ∼open. Our research entails the utilization of this category of sets to form a new concepts in these spaces, namely S∼δ∼limit points and S∼δ∼derive points, and examining its relationship with S∼open and S∼reg∼open. Based on this class of sets, we have introduced other new concepts such as S∼isolated points, S∼δ∼congested points, S∼δ∼adherent points, S∼δ∼dense, S∼δ∼nowhere.dense and S∼δ∼Exterior, and explored their properties. Additionally, we have highlighted the distinctions among these concepts through several examples
The aim of this paper is to introduce and study some of the Fibrewise minimal regular,Fibrewise maximal regular, Fibrewise minimal completely regular, Fibrewise maximal completely regular, Fibrewise minimal normal, Fibrewise maximal normal, Fibrewise minimal functionally normal, and Fibrewise maximal functionally normal. This is done by providing some definitions of the concepts and examples related to them, as well as discussing some properties and mentioning some explanatory diagrams for those concepts.
This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.
In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.
The importance of topology as a tool in preference theory is what motivates this study in which we characterize topologies generating by digraphs. In this paper, we generalized the notions of rough set concepts using two topological structures generated by out (resp. in)-degree sets of vertices on general digraph. New types of topological rough sets are initiated and studied using new types of topological sets. Some properties of topological rough approximations are studied by many propositions.
Abstract: In recent times, global attention has increasingly focused on the critical issue of environmental sustainability, owing to escalating environmental degradation exacerbated by the utilization of green spaces and technological innovation. This phenomenon necessitates thorough examination, prompting the present study to scrutinize the impact of various factors, namely green spaces, technological innovation, environmental taxes, renewable energy consumption (REC), inflation, and economic growth (EG), on environmental sustainability within the context of Iraq. Secondary data extracted from the World Development Indicators (WDI) spanning the period from 1991 to 2022 served as the foundation for this investigation. Methodologically, the
... Show MoreIn this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved
Most real-life situations need some sort of approximation to fit mathematical models. The beauty of using topology in approximation is achieved via obtaining approximation for qualitative subgraphs without coding or using assumption. The aim of this paper is to apply near concepts in the -closure approximation spaces. The basic notions of near approximations are introduced and sufficiently illustrated. Near approximations are considered as mathematical tools to modify the approximations of graphs. Moreover, proved results, examples, and counterexamples are provided.