Saturation number of lattice animals

Authors

  • Tomislav Došlić University of Zagreb, Croatia
  • Niko Tratnik University of Maribor, Slovenia
  • Petra Žigert Pleteršek University of Maribor, Slovenia

DOI:

https://doi.org/10.26493/1855-3974.1279.bce

Keywords:

Maximal matching, saturation number, lattice animal, polyomino graph, benzenoid graph, coronene

Abstract

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.

Published

2018-06-19

Issue

Section

Articles