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.
Suppose that is a finite group and is a non-empty subset of such that and . 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 that is a graph with vertex set consists of all column matrices 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 similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show MoreAn intuitionistic fuzzy set was exhibited by Atanassov in 1986 as a generalization of the fuzzy set. So, we introduce cubic intuitionistic structures on a KU-semigroup as a generalization of the fuzzy set of a KU-semigroup. A cubic intuitionistic k-ideal and some related properties are introduced. Also, a few characterizations of a cubic intuitionistic k-ideal are discussed and new cubic intuitionistic fuzzy sets in a KU-semigroup are defined.
The Al-Shishtary is considered one of the well-known Andalus poets. His poetry represents a flood of kind emotions, springs from the sincere sources of Divine Love, and this is what we felt in his life and his literary prestige. He was a poet who was familiar withthe art of his timeknowsthe oldand popularintellectual assets ofIslamicSciencesof Sharee'a. This wide culture, which he had, is available to him through his many travels between the coasts of Syria, Egypt and others ... to become Imam of the religion way known as(Al-Shishtariyah)resonatedin the hearts ofthe general publicespecially the poor people. This showshis smoothand influential styleand his humanitarian andsimple words which resonate in the hearts of his followers, therefo
... Show MoreThe aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several results are obtained .For example , it shown that ,for any the inequality , is satisfied ,finally, similar result for chebyshev partition and weighted Ditzian –Totik moduli of smoothness are also obtained.
This paper is concerned with the study of the T-norms and the quantum logic functions on BL-algebra, respectively, along with their association with the classical probability space. The proposed constructions depend on demonstrating each type of the T-norms with respect to the basic probability of binary operation. On the other hand, we showed each quantum logic function with respect to some binary operations in probability space, such as intersection, union, and symmetric difference. Finally, we demonstrated the main results that explain the relationships among the T-norms and quantum logic functions. In order to show those relations and their related properties, different examples were built.
In this thesis, we introduced some types of fibrewise topological spaces by using a near soft set, various related results also some fibrewise near separation axiom concepts and a fibrewise soft ideal topological spaces. We introduced preliminary concepts of topological spaces, fibrewise topology, soft set theory and soft ideal theory. We explain and discuss new notion of fibrewise topological spaces, namely fibrewise soft near topological spaces, Also, we show the notions of fibrewise soft near closed topological spaces, fibrewise soft near open topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces. On the other hand, we studied fibrewise soft near forms of the more essent
... Show MoreAssume 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 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).
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 More