2009
DOI: 10.48550/arxiv.0904.3050
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Difference between minimum light numbers of sigma-game and lit-only sigma-game

Abstract: A configuration of a graph is an assignment of one of two states, on or off, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an on vertex. The following result is proved in this note: given any starting configuration x of a tree, if there is a sequence of regular moves which brings x to another configuration in which there are ℓ on vertices then there must exist a sequence of valid moves which takes x to a configuration with… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 28 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?