Graphs that are created from designs have been used in pursuit-evasion problems such as in the cops and robber game, where they maximize the ratio of cops required to vertices. Such graphs are known as Meyniel extremal, and have been observed to have an interesting role in other pursuit-evasion games.

We consider the localization number and metric dimension of designs and certain graphs of diameter 2 with a strong structure, including the families of Kneser graphs, Moore graphs of diameter 2 and polarity graphs.

Bio: Dr. Trent G. Marbach is currently a postdoc at Toronto Metropolitan University (formerly known as Ryerson University); and works on designs, pursuit-evasion on graphs, networks, and machine learning for cloud computing. He received his Ph.D. in Latin squares and designs from the University of Queensland, before completing postdocs at Monash University and Nankai University.