Lit-only sigma-game on nondegenerate graphs

研究成果: 雜誌貢獻期刊論文同行評審

摘要

A configuration of the lit-only-game on a graph is an assignment of one of two states, on or off, to each vertex of. Given a configuration, a move of the lit-only-game on allows the player to choose an on vertex of and change the states of all neighbors of. Given an integer, the underlying graph is said to be-lit if for any configuration, the number of on vertices can be reduced to at most by a finite sequence of moves. We give a description of the orbits of the lit-only-game on nondegenerate graphs which are not line graphs. We show that these graphs are 2-lit and provide a linear algebraic criterion for to be 1-lit.

原文???core.languages.en_GB???
頁(從 - 到)385-395
頁數11
期刊Journal of Algebraic Combinatorics
41
發行號2
DOIs
出版狀態已出版 - 3月 2014

指紋

深入研究「Lit-only sigma-game on nondegenerate graphs」主題。共同形成了獨特的指紋。

引用此