The following section provides information concerning the Andrásfai Graph family.

Definition:

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3).

Value of Adjacency Matrix Game:

n/(3n-1)

Value of M'' :

1/3

Consider removing a vertex option from the column player, how will that then affect the game value?

The color green represents a decrease in the game value if the vertex is chosen, red represents an increase in the game value if the vertex is chosen, and blue represents no change in the game value.