Shahid Imran,LHR TP 5605FA12-PmAth-003Dr. Muhammad Hussain, Assistant Profesor2026-04-282016https://repository.cuilahore.edu.pk/123456789/3716Labeling 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. Labeling of graph is defined as a correspondence from the set } , ,3,2,1{ f e v    to the vertices, edges and faces of a plane graph G in such a way that each vertex, edge and face receives exactly one label and each number is used exactly once as a label. The weight of a face under a labeling of type )1,1,1( is the sum of labels carried by that face and all the edges and vertices surrounding it. A labeling of type )1,1,1( of a plane graph G is called d-antimagic if for every positive integer s the set of weights of all s-sided faces is } )1 ( , , 2 , , { d f a d ad aa      for some integer a and 0d , where f is the number of s-sided faces. In particular when 0d then the d antimagic labeling of type )1,1,1( is called magic labeling of type )1,1,1( . Moreover, if the vertices are labeled by the smallest possible number. It is known as super magic and anti magic accordingly. Furthermore, let G be a connected graph and ) , ( y x d be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by ). ( dimG This dissertation studies about the construction of super face anti-magic labeling of type )1,1,1( for disjoint union of toroidal fullerenes, magic and anti-magic labeling of type )1,1,1( for union of generalized friendship graphs. Metric dimension of Jahangir related graphs, generalized prism related graphs and graphs obtained by rooted product has been also calculated.enValuations And Metric Dimensions On GraphsLHR TP 5605Dr. Muhammad HussainShahid ImranFA12-Thesis