A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.

Antimagic 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 study aims to know the preference of the Iraqi consumer of imported dairy products to local, which has increased demand in recent years due to various reasons including commodity dumping policy that Iraq has been suffering since 2003, which has led to decline in the role of local dairy product in our markets and its inability to compete with imported product for different reasons. The research utilized questionnaire as a survey tool of the opinions of a sample of Iraqi 92 consumers in Baghdad/Alrisafa. The questionnaire consisted of twenty questions included the four components of marketing mixture (product quality, price, place, and promotion). Weighted mean and percentage weight used for data analysis. The study showed that the mos

The study focused on the identification of the natural relation between the organizational components, and the most important is the organizational structure, which not hid its effect on each function and operation of the organizational structure through commanding the individual craters and its forms according to the requirement of these function, also it has relation with an organic synthesis that between the dimensions of the organic synthesis and the practice side in the commission of Integrity.

The problem of the research pensioned in some questions about hypothesis and theoretical parts, in which they go a mention about the hypothesis questions is to use all the knowledge's in this atmosphere and th

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

 Let  be a connected graph with vertices set  and edges set . The ordinary distance between any two vertices of  is a mapping  from  into a nonnegative integer number such that  is the length of a shortest  path. The maximum distance between two subsets  and  of   is the maximum distance between any two vertices  and  such that  belong to  and  belong to . In this paper, we take a special case of maximum distance when  consists of one vertex and  consists of  vertices, . This distance is defined by: where  is the order of  a graph .

     In this paper, we defined  – polynomials based on

Fractal geometry is receiving increase attention as a quantitative and qualitative model for natural phenomena description, which can establish an active classification technique when applied on satellite images. In this paper, a satellite image is used which was taken by Quick Bird that contains different visible classes. After pre-processing, this image passes through two stages: segmentation and classification. The segmentation carried out by hybrid two methods used to produce effective results; the two methods are Quadtree method that operated inside Horizontal-Vertical method. The hybrid method is segmented the image into two rectangular blocks, either horizontally or vertically depending on spectral uniformity crit

Technological development in the last years leads to increase the access speed in the internet networks that allow a huge number of users watching videos online.

     Video streaming important type in the real-time video sessions and one of the most popular applications in networking systems.  The Quality of Service (QoS) techniques give us indicate to the effect of multimedia traffic on the network performance, but this techniques do not reflect the user perception. Using QoS and Quality of Experience (QoE) together can give guarantee to the distribution of video content according to video content characteristics and the user experience .

     To measure the users’ perceptio

The product  of   rn-paracompact and   rn-strongly  paracompact are briefly disc. ussed.