Lit-Only σ-Game and its Dual Game on Tree
碩士 === 國立交通大學 === 應用數學系所 === 98 === Let G be a simple connected graph with n vertices {1, 2, … , n}. A configuration of G is an assignment of one of two colors, black or white, to each vertex of G. A move on the set of configurations of G is a function from the set to itself. Two different games wit...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/78175425391796314631 |