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.

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 .

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

This work aimed to design and testing of a computer program – based eyeQ improvement, photographic memory enhancement, and speed reading to match the reading speed 150 – 250 word per minute (WPM) with the mind ability of processing and eye snap shooting 5000WPM . The package designed based on Visual Basic 6. The efficiency of the designed program was tested on a 10 persons with different levels of education and ages and the results show an increase in their reading speed of approximately 25% in the first month of training with noticeable enhancement in the memory as well as an increase in the ability to read for longer time without feeling nerves or boring, a nonlinear continuously increase in reading speed is assured after the first mo

As long as the place in which a person lives has a meaning and temporal dimensions , memory is the main axis of these dimensions , today , city centers and old historical sectors of cities are abandoned , and began to turn into slums , the contradiction between old and historical sectors led cities to lose their identity while people lost their sense of belongingness to the old sectors where their ancestors used to live . The old city of Hilla used to have social , historical and cultural role on determining the identity . The study problem can be summarized as the ( lack of studies regarding the impact of historical memory related to Hilla old city on social and cultural mobility ) , the study hypothesis claims that the social , histori

This study aims to deeply analyze the character of serial killers in Thomas Harris’ novels and focuses on his novel Red Dragon. The Study searches in these complex and deep characters through the use of Erich Fromm's concepts about the destructive nature of the human psyche and what are the factors affecting serial killers in all social psychological, and biological aspects. This study Concluded: Thomas Harris portrayed the characters of serial killers in a professional and complex and made the reader go on a contemplative journey in the mind and soul of the serial killer, thus reaching the climax of artistic perfection.