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

Background : Knee flexors tightness has been documented in apparently healthy adults and in those with musculoskeletal problems, but the influence of age on the tightness has not been studied in Iraq. This study was therefore designed to determine the influence of age on knee flexors tightness in apparently healthy subjects.Methods: Knee flexors tightness was measured using the active knee extension test (AKET) in 200 apparently healthy male and female subjects, aged 13 to 59 years. The subjects were recruited into 5 age groups using the purposive sampling technique.Knee flexors tightness was compared across the age groups using one-way analysis ofvariance (ANOVA). The independent t-test was used to compare knee flexors tightness on both

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

This study investigates self-perception and self-branding on Instagram among young Arab women in the UAE, focusing on how they curate, negotiate and perform their digital identities and whether their digital self-presentation in any way compromises their sense of authenticity. The study is based on 11 interviews with young women in the UAE, between the ages of 20 and 30, in addition to online observation to follow the participants’ activities on Instagram. The study demonstrates that while social and digital media platforms may play a role in “empowering” Arab women, women tend to set their boundaries of authenticity shaped according to their audience’s expectations and their in-groups. This confirms the r

After studying the reality of application to occupational safety in new Iraqi building projects and sampling the situation wilt that in developed and neighboring countries, researcher found that there is a big gap in the level of safety application conditions, this indicates the need fora quick and clear reference for local engineers to use it on site for safety conditions in their projects . As a case study the monitors work the researcher studied a huge project in the United Arab Emirates.This project considered for safety requirements to highest grades. This case study may be far away from the projects in Iraq, but we hope to rise the Iraqi work level in the near future. After seeing the way of administration work and how they were ra

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef