On the Metric Dimensions for Sets of Vertices

Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, { }-resolving sets were recently introduced. In this paper, we present new results regarding the { }-resolving sets of a graph. In addition to proving general results, we consider {2}-resolving sets in rook’s graphs and connect them to block designs. We also introduce the concept of solid-resolving sets, which is a natural generalisation of solid-resolving sets. We prove some general bounds and characterisations for -solid-resolving sets and show how -solid- and { }-resolving sets are connected to each other. In the last part of the paper, we focus on the infinite graph family of flower snarks. We consider the -solid- and { }-metric dimensions of flower snarks. In two proofs regarding flower snarks, we use a new computer-aided reduction-like approach.