Let 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 is either two or five only.
The present paper is a qualitative descriptive study. It aims to examine the macro-cultural schemata addressing the concept of violence against women in Iraq from a cognitive linguistic point of view. To meet this objective, a number of Iraqi social caricatures have been selected from two popular and active Iraqi caricaturists, Odeh Al-Fahdawi and Nasser Ibrahim. The selection and the analysis of data have been achieved following the validity and reliability procedures and the ethical considerations. To meet this objective, Sharifian’s Model (2011) of Cultural Schemata has been adopted in data analysis. The study has concluded that the macro-cultural schemata regarding the concept of violence in the selected panels reveals that violenc
... Show MoreThe purpose of this paper is to study new types of open sets in bitopological spaces. We shall introduce the concepts of L- pre-open and L-semi-p-open sets
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
This tagged research deals with the manifestations of femininity in Mahmoud Fahmy's drawings by studying and monitoring the presence and how women were represented in the drawings of the artist Mahmoud Fahmy. Through the drawings of the expatriate Iraqi artist, Mahmoud Fahmy, in highlighting the manifestations of beauty for women, which constitute a formal characteristic that appears through the body, and Fahmy depicts it in an atmosphere of realism at times and magical realism at other times, as the research consists of four chapters. Through the following question: Did femininity appear in the drawings of the artist Mahmoud Fahmy? The importance of the research is that it sheds light on the manifestations of femininity in the drawings
... Show MoreBiped robots have gained much attention for decades. A variety of researches have been conducted to make them able to assist or even substitute for humans in performing special tasks. In addition, studying biped robots is important in order to understand human locomotion and to develop and improve control strategies for prosthetic and orthotic limbs. This paper discusses the main challenges encountered in the design of biped robots, such as modeling, stability and their walking patterns. The subject is difficult to deal with because the biped mechanism intervenes with mechanics, control, electronics and artificial intelligence. In this paper, we collect and introduce a systematic discussion of modelin
The research aims to conduct a comparative study between the events (800) m and (1500) m track in the types of muscular strength and to identify the differences between them among Iraqi sports club players. The sample represented the players participating in the Iraqi Athletics Championship for the period between (02/11/2023) and (04 /11/2023), and their number was (16) players (8) for each event, as the selection was made intentionally. The researchers used the descriptive approach to achieve the goal of the research and used the statistical package (SPSS) to process the data statistically. According to the results collected, it was found that there was superiority among the intermediate track players (800) m in explosive power and the s
... Show MoreAntimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
The 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.
Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho
... Show More