Anthony Bonato, Melissa A. Huggan, Trent G. Marbach
Published 2021-03-19Version 1
We highlight new results on the localization number of a graph, a parameter derived from the localization graph searching game. After introducing the game and providing an overview of existing results, we describe recent results on the localization number. We describe bounds or exact values of the localization number of incidence graphs of designs, polarity graphs, and Kneser graphs.
Comments: arXiv admin note: text overlap with arXiv:2005.12780
Total $k$-coalition: bounds, exact values and an application to double coalition
On the decycling of powers and products of cycles
Caps and progression-free sets in $\mathbb{Z}_m^n$
![QR code for arXiv:2103.10587 [math.CO]](http://oss.arxitics.com/images/favicon.svg)