The objective of this study is to determine the extent to which the determinants of organizational support contributed to enhancing the mental status of banking services in a number of banks in Dohuk governorate in order to diagnose the correlation between the perceived organizational support and the mental status of services. Availability in the environment of banks and to enhance the mental position from the point of view of customers as the main hypotheses focused on the nature of the relationship between the dimensions of research among them has been tested these hypotheses using statistical and descriptive methods have been The study concluded that the contribution of organizational support, which is

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

Let R be a commutative ring with identity, and let M be a unity R-module. M is called a bounded R-module provided that there exists an element x?M such that annR(M) = annR(x). As a generalization of this concept, a concept of semi-bounded module has been introduced as follows: M is called a semi-bounded if there exists an element x?M such that . In this paper, some properties and characterizations of semi-bounded modules are given. Also, various basic results about semi-bounded modules are considered. Moreover, some relations between semi-bounded modules and other types of modules are considered.

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 .

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

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 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.

Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .

    Many designs have been suggested for unipolar magnetic lenses based on changing the width of the inner bore and fixing the other geometrical parameters of the lens to improve the performance of unipolar magnetic lenses. The investigation of a study of each design included the calculation of its axial magnetic field the magnetization of the lens in addition to the magnetic flux density using the Finite Element Method (FEM) the Magnetic Electron Lenses Operation (MELOP) program version 1 at three different values of current density (6,4,2 A/mm²). As a result, the clearest values and behaviors were obtained at current density (2 A/mm²). it was found that the best magnetizing properties, the high

     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