engleski

Saturation number of lattice animals

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.

maximal matching ; saturation number ; lattice animal ; polyomino graph ; benzenoid graph ; coronene

nije evidentirano