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.
The purpose of this resesrh know (the effectiveness of cooperative lerarning implementation of floral material for calligraphy and ornamentation) To achieve the aim of the research scholar put the two zeros hypotheses: in light of the findings of the present research the researcher concluded a number of conclusions, including: -
1 - Sum strategy helps the learner to be positive in all the information and regulations, monitoring and evaluation during the learning process.
2 - This strategy helps the learner to use information and knowledge and their use in various educational positions, and to achieve better education to increase its ability to develop thinking skills and positive trends towards the article.
In light of this, the
In this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt
... Show More
(3)
(2)
Let G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy-1 is an involution element. This paper aims to investigate the A4-graph properties for the monster Held group He.
The research starts from a fundamental problem about how top management team can realize the uncertainty. Strategic conversation has been introduced as a way for top management team to deal with uncertainties. Within the current research model, the strategic conversation was considered as an independent variable and uncertainty as dependent variable. The researcher used the survey method by distributed a questionnaire in the Administration and Economics College, University of Baghdad. Samples are 40 faculty participant of scientific committee members were distributed in seven scientific departments. The data were statistically analyzed by mean and the standard deviation. The hypotheses were tested through the use of correlation and regressi
... Show More
(6)
(2)
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 More
(4)
(3)
This paper introduces cutpoints and separations in -connected topological spaces, which are constructed by using the union of vertices set and edges set for a connected graph, and studies the relationships between them. Furthermore, it generalizes some new concepts.
(1)
(1)