Localization and metric dimension for families of highly structured digraphs

We investigate metric dimension and the localization game for several families of directed analogues of strongly regular graphs and their generalizations, adapting a probabilistic method of Babai (1980) for bounding the size of resolving sets in undirected strongly regular graphs.

We derive upper bounds on the localization number and metric dimension depending on the order of the graph and the maximum number of common out-neighbours for a pair of vertices.

We consider normally regular digraphs, so-called "ordinary graphs", classes of Deza digraphs, divisible design digraphs, nearly doubly regular tournaments, and certain doubly regular team tournaments.

In particular, for asymmetric normally regular digraphs on $n$ vertices, we show that these invariants are bounded above by $O(\sqrt{n} \log n)$, and improve this to $O(\log n)$ for a class of doubly regular team tournaments.