Counting Maximal Distance-Independent Sets in Grid Graphs
Reinhardt Euler, Paweł Oleksik, Zdzisław Skupień (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied