The flipping puzzle on a graph

Details The flipping puzzle on a graph The flipping puzzle on a graph

2008-08-15

arxiv.org/abs/0808.2104v2

Mathematics

Combinatorics

18 pages, 1 figure and 1 table

Scientific paper

Let $S$ be a connected graph which contains an induced path of $n-1$ vertices, where $n$ is the order of $S.$ We consider a puzzle on $S$. A configuration of the puzzle is simply an $n$-dimensional column vector over $\{0, 1\}$ with coordinates of the vector indexed by the vertex set $S$. For each configuration $u$ with a coordinate $u_s=1$, there exists a move that sends $u$ to the new configuration which flips the entries of the coordinates adjacent to $s$ in $u.$ We completely determine if one configuration can move to another in a sequence of finite steps.

Affiliated with

Also associated with

No associations

Rating

The flipping puzzle on a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The flipping puzzle on a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The flipping puzzle on a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650730