A dissociation set in a graph is a subset of vertices inducing a subgraph of maximum degree at most 1, and a dissociation set is maximal if it is not a proper subset of any other dissociation set. In this paper, we use the state matrix recursion algorithm to enumerate maximal dissociation sets in grid graphs, cyclical grid graphs and cylindrical grid graphs. We also analyze the growth rates of the numbers of maximal dissociation sets in the three classes of grid graphs.

中文翻译：

---

枚举三类网格图中的最大解离集

图中的解离集是导出最大度数最多为 1 的子图的顶点子集，如果解离集不是任何其他解离集的真子集，则它是最大的。在本文中，我们使用状态矩阵递归算法来枚举网格图、循环网格图和圆柱网格图中的最大解离集。我们还分析了三类网格图中最大解离集数量的增长率。