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

Abstract

A new type of solar air heater was designed, fabricated, and tested in Baghdad, Iraq winter conditions. The heater consists of two main parts. The horizontal section was filled with the black colored iron chip while the vertical part has five pipes filled with Iraqi paraffin wax. A fan was fixed at the exit of the air. Two cases were studied: when the air moved by natural convection and when forced convection moved it. The studied air heater has proven its effectiveness as it heated the air passing through it to high temperatures. The results manifest that using little air movement makes the temperatures, stored energies, and efficiencies of the two studied cases converge

As computers become part of our everyday life, more and more people are experiencing a
variety of ocular symptoms related to computer use. These include eyestrain, tired eyes, irritation,
redness, blurred vision, and double vision, collectively referred to as computer vision syndrome.
The effect of CVS to the body such as back and shoulder pain, wrist problem and neck pain.
Many risk factors are identified in this paper.
Primary prevention strategies have largely been confined to addressing environmental
exposure to ergonomic risk factors, since to date, no clear cause for this work-related neck pain
has been acknowledged. Today, millions of children use computers on a daily basis. Extensive
viewing of the compute

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.

     Brachycerous Dipteran species on alfalfa plant Medicago sativa surveyed in several regions of Iraq from March to November 2012. The study was registered 14 species belonging to nine genera and four families. The results showed that Limnophra quaterna, Atherigona laevigata and Atherigona theodori as new records to Iraq and new pests of alfalfa.

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