Enumerating independent vertex sets in grid graphs

Seungsang Oh, Sangyop Lee

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 O…