  A set of vertices in a graph is called independent if no two vertices of the
set are connected by an edge. In this paper we use the state matrix recursion
algorithm, developed by Oh, to enumerate independent vertex sets in a grid
graph and even further to provide the generating function with respect to the
number of vertices. We also enumerate bipartite independent vertex sets in a
grid graph. The asymptotic behavior of their growth rates is presented.
