The limit checker number of a graph Original Research Article

The checker number is an invariant of a graph defined as the result of a game played on its vertices. Studying its behavior on the powers of a graph, we found that it is surprisingly similar to the well-known Shannon capacity and we defined an analogous quantity — the limit checker number. Finally, we proved that this number can be calculated as a simple weight function of the original graph.