On the Partition Dimension of Circulant Graphs

Cyriac Grigorious, Sudeep Stephen, Bharati Rajan +2

For a vertex $v$ of a connected graph $G(V,E)$ and a subset $S$ of $V$, the distance between $v$ and $S$ is defined by $d(v,S)=min\{d(v,x):x\in S\}.$ For an ordered \emph{k}-part…