Fault-Tolerant Metric Dimension of $P(n,2)$ with Prism Graph

Z. Ahmad, M. O. Ahmad, A. Q. Baig +1

Let $G$ be a connected graph and $d(a,b)$ be the distance between the vertices $a$ and $b$. A subset $U=\{u_1,u_2,\cdots ,u_k\}$ of the vertices is called a resolving set for $G$ i…