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.
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
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.
In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.
The aim of this paper is to introduce and study new class of fuzzy function called fuzzy semi pre homeomorphism in a fuzzy topological space by utilizing fuzzy semi pre-open sets. Therefore, some of their characterization has been proved; In addition to that we define, study and develop corresponding to new class of fuzzy semi pre homeomorphism in fuzzy topological spaces using this new class of functions.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B
... Show MoreThis paper presents the concepts of prepaths, paths, and cycles in α-topological spaces and studies them in orderable spaces. Also, many relationships are proved with their equivalences using some properties in topological spaces like compactness and locally connectedness.
Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreLet R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by P-VG(R) , in this work we got some new results a bout chromatic number of P-VG(R).