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

A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties

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

In this study, a brand-new graph definition known Associate graph of a ring R denote Ass(R) is present, where the graph’s vertices stand in for R’s elements s.t, any two vertices α and β  merage by an edge if and only if α = rβ and β = sα. In this paper, we investigated some new property of Ass (R)  are studied., the complement of Ass (R) is finally defined and a few of its characteristics are researched.

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

Cancer is in general not a result of an abnormality of a single gene but a consequence of changes in many genes, it is therefore of great importance to understand the roles of different oncogenic and tumor suppressor pathways in tumorigenesis. In recent years, there have been many computational models developed to study the genetic alterations of different pathways in the evolutionary process of cancer. However, most of the methods are knowledge-based enrichment analyses and inflexible to analyze user-defined pathways or gene sets. In this paper, we develop a nonparametric and data-driven approach to testing for the dynamic changes of pathways over the cancer progression. Our method is based on an expansion and refinement of the pathway bei

This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor

Background. Aneurysms of the distal anterior cerebral artery (DACA) are uncommon; they often form near the pericallosal-callosomarginal junction and are typically small. To our knowledge, giant DACA aneurysms developing from the more distant parts of the anterior cerebral artery (ACA), A4-5, have been described only once in the literature. Case description. A 66-year-old gentleman reported with a brief loss of consciousness followed by weakness in his right lower leg. The patient was admitted with a Glasgow Coma Score (GCS) of 15. A computed tomography (CT) scan of the head revealed a left hyperdense mass in the frontal parasagittal supracallosal region. Contrast MRI revealed a heterogeneously enhancing mass measuring 35x30x25 mm. C

Background: Breast cancer is the commonest type of malignancy worldwide and in Iraq. It is a serious disease that affects the general health and cause systemic changes that affect the physical and chemical properties of saliva leading to adverse effects on oral health. This study was conducted toassess the tumor marker CA15-3 and selected elements in saliva and their relation to oral health status among breast cancer patients compared to control group. Materials and Methods: The total sample consisted of 60 women aged 35-45 years. 30 women were newly diagnosed with breast cancer before taking any treatment and surgery (study group) and 30 women without clinical signs and symptoms of breast cancer as a control group. Dental caries was record

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