The flipping puzzle on a graph

DOI10.1016/J.EJC.2009.08.001MaRDI QIDQ992785zbMATH OpenOpenAlexFDO

Authors Chih-Wen Weng, Hau-Wen Huang

Publication date 10 September 2010

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0808.2104

zbMATH Keywords

connected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Abstract: 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.

Recommendations

• The edge-flipping group of a graph
• Pebble exchange on graphs
• Sequentially swapping colored tokens on graphs
• Solvable Trees
• Sliding puzzles and rotating puzzles on graphs

Cites work

• scientific article; zbMATH DE number 3880941 (Why is no real title available?)
• scientific article; zbMATH DE number 3482588 (Why is no real title available?)
• scientific article; zbMATH DE number 3489142 (Why is no real title available?)
• scientific article; zbMATH DE number 3428979 (Why is no real title available?)
• Equivalence classes of Vogan diagrams
• Extended Vogan diagrams
• GRAPHS AND NIELSEN TRANSFORMATIONS OF SYMMETRIC, ORTHOGONAL, AND SYMPLECTIC GROUPS
• Invariants of real forms of affine Kac-Moody Lie algebras
• Level-two structure of simply-laced Coxeter groups.
• Lie Algebras of Characteristic 2
• Lie groups beyond an introduction
• Lit-only sigma game on a line graph
• Lit-only sigma-game on nondegenerate graphs
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Orbits Under Symplectic Transvections I
• Orbits of groups generated by transvections over \(\mathbb{F}_2\).
• Some groups generated by transvections
• Some subgroups of \(SI_ n(F_2)\)
• Vogan diagrams of real forms of affine Kac-Moody Lie algebras

Cited in

(7)

• The edge-flipping group of a graph
• Sliding puzzles and rotating puzzles on graphs
• Proving the pressing game conjecture on linear graphs
• Solvable Trees
• Lit-only \(\sigma \)-game on pseudo-trees
• Puzzling and apuzzling graphs
• Pebble exchange on graphs

This page was built for publication: The flipping puzzle on a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992785)