On 2-partition dimension of rotationally-symmetric graphs

Abstract

The [Formula: see text]-partition dimension of graphs was introduced as generalization of partition dimension of graphs by Estrado–Moreno in 2020. Its applications can be seen in several areas including robot navigation, network designing, image processing and chemistry. Rotationally symmetric graphs are important in computer network topologies due to uniform rate of data transformation to all nodes. In this paper, we compute the lower bound of the [Formula: see text]-partition dimension of [Formula: see text]-regular graphs for [Formula: see text] and also calculate the [Formula: see text]-partition dimension of the families of rotationally symmetric graphs, namely, prism graph and [Formula: see text]-sunlet graph.