On the Metric Dimension of the Reduced Power Graph of a Finite Group

Abstract

Let $G$ be a finite group. The reduced power graph of $G$ is the undirected graph whose vertex set is $G$, and two distinct vertices $x$ and $y$ are adjacent if $\langle x \rangle \subset \langle y \rangle$ or $\langle y \rangle \subset \langle x \rangle$. In this paper, we give tight upper and lower bounds for the metric dimension of the reduced power graph of a finite group. As applications, we compute the metric dimension of the reduced power graph of a $\mathcal{P}$-group, a cyclic group, a dihedral group, a generalized quaternion group, and a group of odd order.