In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological

This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.

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

This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor

Topology and its applications occupy the interest of many researching centers in the advanced world. From this point of view and because the near open sets play a very important role in general topology and they are now the research topics of many topologists worldwide and its sets doesn’t enter in fibrewise topology yet. Therefore, we use some of the near open sets to be model for introduce results and new spaces in fibrewise topological spaces. Also, there is a very important role of closure operators in constructing a topological spaces, so we introduce a new closure operators on the power set of vertices on graphs and conclusion theorems and new spaces from it. Furthermore, we discuss the relationships of connectedness between some ty

      Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and

This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.

Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation  on a set  can always be represented by a digraph. Topology on a set  can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.

In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has  complete induced subgraphs with order  or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius