The edge-flipping group of a graph

DOI10.1016/j.ejc.2009.06.004zbMath1221.05199arXiv0809.4399OpenAlexW2138354715MaRDI QIDQ966148

Hau-Wen Huang, Chih-Wen Weng

Publication date: 27 April 2010

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

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

zbMATH Keywords

edge-flipping puzzle

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (2)

Lit-only \(\sigma \)-game on pseudo-trees ⋮ Lit-only sigma-game on nondegenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The flipping puzzle on a graph
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• Vogan diagrams of real forms of affine Kac-Moody Lie algebras
• Equivalence classes of Vogan diagrams
• Invariants of real forms of affine Kac-Moody Lie algebras
• Extended Vogan diagrams
• Lit-only sigma game on a line graph
• Lie groups beyond an introduction
• Note on the lamp lighting problem

This page was built for publication: The edge-flipping group of a graph