Further new results on strong resolving partitions for graphs (Q2189231)

For \(x\in V(G)\) and \(W\subseteq V(G)\), the distance between \(x\) and \(W\) is denoted by \(d_G(x,W)=\min\{d_G(x,w):w\in W\}\), where \(d_G(x,w)\) denotes the length of a shortest \(x\)--\(w\) path. A set \(W\subseteq V(G)\) strongly resolves two different vertices \(x,y\in W\) if either \(d_G(x,W)=d_G(x,y)+d_G(y,W)\) or \(d_G(y,W)=d_G(y,x)+d_G(x,W)\). An ordered vertex partition \(\prod=\{U_1,U_2,\dots,U_k\}\) of a graph \(G\) is a strong resolving partition for \(G\), if every two distinct vertices of \(G\), belonging to the same set of the partition, are strongly resolved by some set of \(\prod\). A strong resolving partition of minimum cardinality is said to be a strong partition basis, and its cardinality the strong partition dimension of \(G\), denoted by \(\operatorname{pd}_s(G)\). In this paper, the authors derive several bounds and closed formulae for the strong partition dimension of some families of graphs, and show some realization results relating the strong partition dimension, the strong metric dimension and the order of graphs. These are well-studied topics in graph theory.