Progress on the localization number of a graph
classification
🧮 math.CO
keywords
localizationnumbergraphgraphsresultsdescribegamebounds
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.