The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation 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.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show MoreThe primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.
The research demonstrates new species of the games by applying separation axioms via sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via sets have been studied.
The aim of the present work is to define a new class of closed soft sets in soft closure spaces, namely, generalized closed soft sets (
In this paper, we define a new type of pairwise separation axioms called pairwise semi-p- separation axioms in bitopological spaces, also we study some properties of these spaces and relationships of each one with the ordinary separation axioms in the bitopological spaces.
This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.
In this article, the notions are introduced by using soft ideal and soft semi-open sets, which are - - - -closed sets " -closed" where many of the properties of these sets are clarified. Some games by using soft- -semi, soft separation axioms: like ( 0 ( 0 Using many figures and proposition to study the relationships among these kinds of games with some examples are explained.
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.