On Twodimensional Cayley Graphs

Abstract. a subset w of the vertices of a graph g is a resolving set for g when for each pair of distinct vertices u, v ∈ v (g) there exists w ∈ w such that d(u, w) ≠ d(v, w). the cardinality of a minimum resolving set for g is the metric dimension of g. this concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization. the problem of finding metric dimension is np-complete for general graphs but the metric dimension of trees can be obtained using a polynomial time algorithm. in this paper, we investigate the metric dimension of cayley graphs on dihedral groups and we characterize a family of them.