Abstract :
We consider Go played on a given graph instead of on a checkered board. Let G be a graph. Let G′=G+v be the join of G and another vertex v. Suppose that a white stone is placed at v in the initial stage. A graph G is called a nakade graph, if Black begins to play he can capture the white stone on v eventually. We investigate nakade graphs from a graph theoretic viewpoint. In particular, we focus on the length of smallest cycles, the maximum degree and the diameter of nakade graphs.
