We study a version of the lights out game played on directed graphs. For a
digraph , we begin
with a labeling of
with elements of
for
. When a vertex
is toggled, the labels
of
and any vertex
that
dominates are
increased by 1 mod
.
The game is won when each vertex has label 0. We say that
is
-always winnable
(also written
-aw)
if the game can be won for every initial labeling with elements of
. We prove that all
acyclic digraphs are
-aw
for all
,
and we reduce the problem of determining whether a graph is
-aw to
the case of strongly connected digraphs. We then determine winnability for certain
tournaments with feedback arc sets that arc-induce directed paths or directed
star digraphs.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.91
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.