دُرِست العوامل المؤثرة في عدد ساعات تجهيز الكهرباء في مدينة بغداد، وتكونت عينة الدراسة من (365) مشاهدة يومية لعام 2018، وتمثلت بستة متغيرات استعملت في الدراسة. كان الهدف الرئيس هو دراسة العلاقة بين هذه المتغيرات، وتقدير تأثيرات المتغيرات التنبؤية في المتغير التابع (عدد ساعات تجهيز الكهرباء في مدينة بغداد). ولتحقيق ذلك استعملت نمذجة المعادلات الهيكلية/ تحليل المسار وبرنامج AMOS

This research is trying to study the Intellectual political structures of the Open Society according to British Thinker –with Austrian origin- Karl Popper (1902-1994). In First Axe we dealt with the context of Open and Closed society in the Popper's thought. While in the Second Axe we studied the Utopian and graduated Engineering. Finally in the third Axe  for the Rationalism, Freedom, Individualism, and the Democracy of Equality. 

     The research tagged (Perceived Organizational Support in High Performance) deals with identifying the extent of the impact of perceived organizational support as an explanatory variable on high performance as a response variable for the purpose of reaching appropriate mechanisms that enable colleges of the University of Baghdad to exploit the perceived organizational support in achieving the required high performance and pursuit of its goals. The researcher relied on the descriptive and analytical approach in carrying out the research. An intentional sample was selected and reached (70) persons from the higher leadership of the colleges represented by (deans, assistants deans, heads of departments) that r

     The aim of this paper to study the effect of the implicit factors on the entrepreneurial spirit of the students of the Algerian university. Our structural model was proposed based on the model (Shapiro et Sokol, 1982) and the model (Ajzen, 1991). We tested it on a sample of 163 university students at the University of Algiers 3. The model consists of a set of variables (the intention of contracting as a dependent variable, structural and social educational support as independent variables). The results showed that educational and social support factors affect the entrepreneurial spirit of students more than structural support. The Applied Impacts are the enhancing of knowledge capacities of university stu

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &

     The stress(Y) – strength(X) model reliability Bayesian estimation which defines life of a component with strength X and stress Y (the component fails if and only if at any time the applied stress is greater than its strength) has been studied, then the reliability; R=P(Y<X), can be considered as a measure of the component performance. In this paper, a Bayesian analysis has been considered for R when the two variables X and Y are independent Weibull random variables with common parameter α in order to study the effect of each of the two different scale parameters β and λ; respectively, using three different [weighted, quadratic and entropy] loss functions under two different prior functions [Gamma and extension of Jeffery

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

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 i

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C