Saturation number of lattice animals
DOI:
https://doi.org/10.26493/1855-3974.1279.bceKeywords:
Maximal matching, saturation number, lattice animal, polyomino graph, benzenoid graph, coroneneAbstract
A matching M in a graph G is maximal if no other matching of G has M as a proper subset. The saturation number of G is the cardinality of any smallest maximal matching in G. In this paper we investigate saturation number for several classes of square and hexagonal lattice animals.
Downloads
Published
2018-06-19
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/