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 spaces, namely o-space and i-space. In chapter four we introduce two new approximation operators using mixed degree systems and comparing of them and we find the accuracy of the second new approximation operator is more thin the first new approximation operator. For reason we study in detail the properties of the second new operator. Finally, in chapter five we introduce new generalization of rough set theory using a finite number of graphs by using the second new approximation operators in the preiow chapter. Several characterizations and properties of these concepts are obtained.
Let be any connected graph with vertices set and edges set . For any two distinct vertices and , the detour distance between and which is denoted by is a longest path between and in a graph . The detour polynomial of a connected graph is denoted by ; and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.
A graph
is said to be singular if and only if its adjacency matrix is singular. A graph
is said to be bipartite graph if and only if we can write its vertex set as
, and each edge has exactly one end point in
and other end point in
. In this work, we will use graphic permutation to find the determinant of adjacency matrix of bipartite graph. After that, we will determine the conditions that the bipartite graph is singular or non-singular.
Our main interest in this study is to look for soft semi separations axioms in soft quad topological spaces. We talk over and focus our attention on soft semi separation axioms in soft quad topological spaces with respect to ordinary points and soft points. Moreover study the inherited characteristics at different angles with respect to ordinary points and soft points. Some of their central properties in soft quad topological spaces are also brought under examination.
In this paper, we procure the notions of neutrosophic simply b-open set, neutrosophic simply b-open cover, and neutrosophic simply b-compactness via neutrosophic topological spaces. Then, we establish some remarks, propositions, and theorems on neutrosophic simply
b-compactness. Further, we furnish some counter examples where the result fails.
We introduce and discuss the modern type of fibrewise topological spaces, namely fibrewise fuzzy topological spaces. Also, we introduce the concepts of fibrewise closed fuzzy topological spaces, fibrewise open fuzzy topological spaces, fibrewise locally sliceable fuzzy topological spaces and fibrewise locally sectionable fuzzy topological spaces. Furthermore, we state and prove several theorems concerning these concepts.
Let
be a dynamical system,
is said to be topological transitive if for every pair of non-empty open set
, there exists
such that
. We introduce and investigate a new definition of topological transitive by using the nation N-open subset and we called N-transitive and prove the equivalent definitions of this new definition.
A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties
Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A4-graph of G, as a simple graph denoted by A4(G,X) which has X as a vertex set. Two vertices, x and y, are adjacent if and only if x≠y and x y-1=y x-1. General properties of the A4-graph as well as the structure of A4(G,X) when G@ 3D4(2) will be studied.
The topic of the research revolves around constructivist theory, which is one of the most important theories that added weight to the theoretical and epistemological field of international relations. The constructivist theory studies international relations from a completely different side of theories by focusing on the social aspects of international relations, and by looking at international relations as social constructs. Ideas, cultures, norms, standards and language play a major role in their formation. The study also examines the state of the war on terrorism as it represents one of the most international cases in which its composition and composition coincide with constructive ideas and a
... Show More