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 types of graphs and new spaces by using graph closure operators and we give some definitions of near open subgraphs using the new closure operators on graphs. The boundary regions in approximation spaces are considered as uncertainty regions. There are a lot of information which result from many experiments that may make the boundary regions to be all elements of the society under study or to be all elements of the society except a small number of elements, which leads to the failure of several results and decisions which could be reached in such cases. In the context of this thesis, we tried to introduce some solution to such dilemmas, through the division of the boundary regions into several levels. This leaves us to get to the mechanism for decreasing the boundary regions and making it small as possible. We also offer some theories of uncertainty through the topological spaces which result from new closure operator of graphs on the approximation spaces. Finally, we study some related applications.
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
... Show MoreThis 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
... Show MoreThis paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.
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
... Show More
(4)
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.
The aim of this thesis is to introduce a new concept of fibrewise topological spaces which is said to be fibrewise slightly topological spaces. We generalize some of the main results that have been reached from fibrewise topology into fibrewise slightly topological space. We introduce the concepts of fibrewise slightly closed, fibrewise slightly open, fibrewise locally sliceable, and fibrewise locally sectionable slightly topological spaces. Also, state and prove several propositions related to these concepts. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise slightly T_0 spaces, fibrewise slightly T_1 spaces, fibrewise slightly R_0 spaces, fibrewise s
... Show MoreIn this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.
This article contains a new generalizations of Ϻ-hyponormal operators which is namely (Ϻ,θ)-hyponormal operator define on Hilbert space H. Furthermore, we investigate some properties of this concept such as the product and sum of two (Ϻ, θ)-hyponormal operators, At the end the operator equation where , has been used for getting several characterization of (Ϻ,θ)-hyponormal operators.
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
... Show More
(9)
(4)
