The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.
The research dealt with the topic ' the aesthetics of design shape of interior spaces for the syndicate of physicians' as it reflects visions evolving to the level of tasting and positive interpretation for the space of work to be on a high design level.The research consisting of four chapters as follow; The first chapter examined the problem of the research contracted in the following question: Have the design shapes any role in achieving and showing the aesthetic side for the syndicate of physicians? so the goal of the research was showing the aesthetics of design shape of interior spaces for the syndicate of physicians, The chapter also included the objective spatial and temporal limits of research .Finally the terms were specified. T
... Show MoreIn 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 MoreThe aim of this research is to investigate the skills of the chemistry students from the Ibn Al-Haytham Education college of pure sciences in Baghdad in understanding and constructing graphical representations of data. The research sample consisted of (101) male and female students in their fourth year of study during the 2016-2017 academic year. This sample represents 71% of the total number of students in this group.The research methodology used consisted of two parts relating to 19 issues. The first part is an objective multi choice type of test to measure the student’s skill in selecting the right representation of specific subject graph amongst many provided. The second part concentrated on measuring the student’s skill in construc
... Show MoreConsider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.
The current research dealt with the study of space compatibility and its role in enhancing the functional aspect of the design of the interior spaces of isolation hospitals by finding a system or format that is compatible with the nature of the changes occurring in the structure and function of the space system, as well as contributing to enhancing compatibility between the functional aspect and the interior space. Therefore, the designer must The interior is the study of the functional and spatial aspects as they are the basic aspects for achieving suitability, and through the interaction between the person and the place, the utilitarian performance characteristics are generated that the interior designer is interested in and tries to d
... Show MoreThe concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.
The purchase of a home and access to housing is one of the most important requirements for the life of the individual and the stability of living and the development of the prices of houses in general and in Baghdad in particular affected by several factors, including the basic area of the house, the age of the house, the neighborhood in which the housing is available and the basic services, Where the statistical model SSM model was used to model house prices over a period of time from 2000 to 2018 and forecast until 2025 The research is concerned with enhancing the importance of this model and describing it as a standard and important compared to the models used in the analysis of time series after obtaining the
... Show MoreThis paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set, μ(u, v) ≤ σ(u) ᴧ σ(v) and η(e) = μ(u1, u2) ᴧ μ(u2, u3) ᴧ … ᴧ μ(un-1, un) ≤ σ(u1) ᴧ σ(un), if e = (u1, u2, …, un), n ≥ 2 is an edge in the semigraph G
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More