Lit-only image-game on pseudo-trees Original Research Article

A configuration of a graph is an assignment of one of two states, ON or OFF, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an ON vertex. A pseudo-tree is a graph obtained from a tree by attaching zero or more loops. The following result is proved in this note: given any st