Abstract
Solitaire Clobber is a one-player combinatorial game on graphs. Each vertex of a graph G starts with a black or a white stone. A stone on one vertex can clobber an adjacent stone of the opposite color, removing it and taking its place. The goal is to minimize the number of stones remaining when no further move is possible. An initial configuration is k-reducible if it can be reduced to k stones. A graph is strongly 1-reducible if, for any vertex v, any initial configuration that is not monochromatic outside v can be reduced to one stone, on v, of either color. Every such graph has a Hamiltonian path ending at v. For the path Pn, we prove that the rth distance power Pnr is strongly 1-reducible when r≥3 but not when r=2 (Pn2 is 2-reducible). As a consequence, circulant graphs containing edges of lengths 1, 2, and 3 are strongly 1-reducible; we show also that those containing Cn2 are 1-reducible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
