Saturation number of lattice animals.

Niko Tratnik,Tomislav Doslic,Petra Zigert Pletersek

Ars Math. Contemp.（2018）

引用 0|浏览6

暂无评分

摘要

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

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要