Ayesha Razzaq,SP16-RMT-010Dr. Hafiz Muhammad Afzal Siddiqui, Assistant ProfesorLHR TP 53322026-04-282018https://repository.cuilahore.edu.pk/123456789/3727An ordered subset set for of nodes of is called a resolving set or locating if each node is individually determined by its code of distances to the nodes in . A resolving set of minimum number of nodes is called a basis for and this cardinality is the metric dimension or location number of , represented as In this thesis, we compute the metric dimension of some wheel related graphs, such as m-level gear graph, m-level antiweb-wheel graph, m-level antiweb-gear graph and an infinite class of convex polytopes denoted by respectively. We prove that the metric dimension of aforementioned wheel related graphs and a family of convex polytope is not bounded. The unbounded metric dimension of convex polytope also furnish a negative answer to the problem given in [19]: Open Problem: “Is it the case that the graph of every convex polytope has constant metric dimension?” It is natural to ask for characterization of graphs with unbounded metric dimension.endepartment of mathematicsLHR TP 5332Computing Metric Dimension of M-Level Wheel Related GraphsAyesha RazzaqThesis