The flipping puzzle on a graph

Hau wen Huang*, Chih-wen Weng

*此作品的通信作者

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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 us=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.

原文English
頁(從 - 到)1567-1578
頁數12
期刊European Journal of Combinatorics
31
發行號6
DOIs
出版狀態Published - 1 8月 2010

指紋

深入研究「The flipping puzzle on a graph」主題。共同形成了獨特的指紋。

引用此