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 stories of children in Iraq during the past two decades have received a number of important scientific studies. Despite tyranny of the historical study method on most of these studies, they have been and still are very important, because they have established a chronicle of this literary style that has been neglected and based not only on the academic level and serious in-depth university studies but also on the enclosed sight that doesn’t consider studied art as an innovation with its specificity and its typical technical components. While many of the public impressions and self-reflections contributed to the dominance of some of the provisions and concepts that were circulated as critical remarks and adopted by som

In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.

 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

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

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

      Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J₂, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

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 &

This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs