Ali TabraizFA12-PMATH-001LHR TP 4824Dr. Muhammad Hussain2026-03-132016https://repository.cuilahore.edu.pk/handle/123456789/2786Labeling of graph is a beautiful and rich technique of Mathematics. It has extensive usage in applications such as data transmission, x-ray, circuit design, astronomy, communication links and coding theory. A labeling of a graph is a mapping that carries some set of graph elements into (usually positive integers). An ) , ( d a face anti-magic total labeling of a graph, with p vertices, q edges and f faces, is a one-to-one mapping that takes the vertices, edges and faces into }, , , 2 , 1 { f q p such that the sums of the label on the edges, vertices and faces form an arithmetic progression starting at a and having difference . d An edge magic total labeling of a graph G is a one-to-one mapping from ) ( ) ( G E G V onto the integers }, , , 2 , 1 { q p with the property that there is an integer constant k such that k y xy x ) ( ) ( ) ( for any ). (G E y x Furthermore, the edge-magic deficiency of a graph , G ) (G is defined as the minimum non-negative integer n such that 1 K n G is edge-magic.enDr. Muhammad Hussainfa12Department of MathematicsMathematicsAnti-Magic LabelingsThesis