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

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 .

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

The current research seeks to identify mono-multi Vision and its relation to the psychological rebellion and personality traits of university students. To achieve this aim, the researcher has followed all the procedures of the descriptive correlational approach, as it is the closest approach to the objectives of the current research. The researcher has determined his research community for Baghdad University students for the academic year 2019-2020. As for the research sample, it was chosen by the random stratified method with a sample of (500) male and female students. In order to collect data from the research sample, the researcher adopted a mono-multi-dimensional scale

(Othman, 2007), the researcher designed a psychological r

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

Narcissus tazetta, a member of the Amaryllidaceae family, is known to be rich in bioactive metabolites such as alkaloids, phenolics and flavonoids, which have been found in nearly every species in this family. N. tazetta cultivated in Iraq, had not previously been studied for its active components; thus, the current study used phytochemical screening and phenolic compounds estimation, both qualitatively and quantitatively. Results showed that the plant alcoholic extract was rich in alkaloids, polyphenols and flavonoids besides tannins, polysaccharides and saponins. Qualitatively; TLC and HPLC chromatogram for total phenolics and flavonoids compounds revealed the presence of Gallic acid (GA), Caffeic acid (CA), Paracumar

Different coating layers of fluorescent agent (FCA) on the solar cells were used. An increase of 35% in the energy conversion efficiency of the solar cell have been obtained. This increase is attributed to the reduction ofthe reflected light, eflection spectra show low values at higher thickness which explained the increase ofthe conversion efficiency with increases of layer thickness.