Abstract:
In this thesis, we study a well-known concept of graph theory, called resolvability, in context of two types of graphs ( commuting and non-commuting) associated to two algebraic structures (dihedral and semi-dihedral groups). By analyzing the resolving share and the average resolving share of each vertex, we compute the resolving topological index of each graph.