摘要： A configuration of the lit-only σ-game on a finite graph Γ is an assignment of one of two states, on or off, to all vertices of Γ. Given a configuration, a move of the lit-only σ-game on Γ allows the player to choose an on vertex s of Γ and change the states of all neighbors of s. Given any integer k, we say that Γ is k-lit if, for any configuration, the number of on vertices can be reduced to at most k by a finite sequence of moves. Assume that Γ is a tree with a perfect matching. We show that Γ is 1-lit and any tree obtained from Γ by adding a new vertex on an edge of Γ is 2-lit. 出版者： Elsevier Inc 出版日期： 2013-02-01 出處： Linear algebra and its applications, 2013-02, Vol.438 (3), p.1057-1066 資源來源： Elsevier ScienceDirect Journals 版權： 2012 Elsevier Inc. 識別號： ISSN: 0024-3795 識別號： EISSN: 1873-1856 識別號： DOI: 10.1016/j.laa.2012.08.033
