The flipping puzzle on a graph

DOI10.1016/J.EJC.2009.08.001zbMATH Open1226.05237arXiv0808.2104OpenAlexW2105550682MaRDI QIDQ992785FDOQ992785

Authors: Chih-Wen Weng, Hau-Wen Huang 

Publication date: 10 September 2010

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

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.

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

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

zbMATH Keywords

connected graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Happy endings for flip graphs
• Lit-only \(\sigma \)-game on pseudo-trees
• Puzzling and apuzzling graphs
• The edge-flipping group of a graph
• Pebble exchange on graphs
• Solvable Trees
• Proving the pressing game conjecture on linear graphs
• Sliding puzzles and rotating puzzles 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)