The following section provides information concerning the Complete Graph family.

Definition:

A complete graph is a graph in which each pair of graph vertices is connected by an edge.

Value of Adjacency Matrix Game:

1/n

Value of M'' :

1/(n-1)

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.