Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 All Title Author Keywords Abstract
 Publish in OALib Journal ISSN: 2333-9721 APC: Only $99  Views Downloads  Relative Articles More on the pressing down game Winning the pressing down game but not Banach Mazur Total Game Coloring of Graphs Tron, a combinatorial Game on abstract Graphs Towards Proving Legendre's Conjecture A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory Proving the Herman-Protocol Conjecture Refuting Unique Game Conjecture On a game on graphs Permutation sorting and a game on graphs More... # Proving the Pressing Game Conjecture on Linear Graphs  Full-Text Cite this paper Abstract: The pressing game on black-and-white graphs is the following: Given a graph$G(V,E)$with its vertices colored with black and white, any black vertex$v$can be pressed, which has the following effect: (a) all neighbors of$v$change color, i.e. white neighbors become black and \emph{vice versa}, (b) all pairs of neighbors of$v$change connectivity, i.e. connected pairs become unconnected, unconnected ones become connected, (c) and finally,$v$becomes a separated white vertex. The aim of the game is to transform$G$into an all white, empty graph. It is a known result that the all white empty graph is reachable in the pressing game if each component of$G\$ contains at least one black vertex, and for a fixed graph, any successful transformation has the same number of pressed vertices. The pressing game conjecture is that any successful pressing path can be transformed into any other successful pressing path with small alterations. Here we prove the conjecture for linear graphs. The connection to genome rearrangement and sorting signed permutations with reversals is also discussed.

Full-Text

service@oalib.com

QQ:3279437679