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

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

     The concept of separation axioms constitutes a key role in general topology and all generalized forms of topologies. The present authors continued the study of gpα-closed sets by utilizing this concept, new separation axioms, namely gpα-regular and gpα-normal spaces are studied and established their characterizations. Also, new spaces namely gpα-T_k  for k = 0, 1, 2 are studied.

     In this paper we introduce a new class of sets called -generalized b- closed (briefly gb closed) sets. We study some of its basic properties. This class of sets is strictly placed between the class of gp- closed sets and the class of gsp- closed sets. Further the notion of b- space is introduced and studied.

2000 Mathematics Subject Classification: 54A05

This paper focuses on developing a strategy to represent the -connected ominoes using an abacus. We use the idea of -connected ominoes with respect to a frame in modelling nested chain abacus. Then, we formulate and prove the unique connected partition for any -connected ominoes. Next, the topological structure of nested chain abacus is presented.

In this paper we introduce a new type of functions called the generalized regular
continuous functions .These functions are weaker than regular continuous functions and
stronger than regular generalized continuous functions. Also, we study some
characterizations and basic properties of generalized regular continuous functions .Moreover
we study another types of generalized regular continuous functions and study the relation
among them