Counting maximal distance-independent sets in grid graphs

DOI10.7151/dmgt.1707zbMath1322.05109OpenAlexW2015610404WikidataQ60692824 ScholiaQ60692824MaRDI QIDQ2857030

Paweł Oleksik, Zdzisław Skupień, Reinhardt Euler

Publication date: 31 October 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1707

zbMATH Keywords

transfer matrix methodFibonacciindependent setgrid graphPadovan numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (2)

Maximal independent sets on a grid graph ⋮ Maximal independent sets in grid graphs

This page was built for publication: Counting maximal distance-independent sets in grid graphs