izvor podataka: crosbi
✓
Saturation number of lattice animals (CROSBI ID 259351)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Došlić, Tomislav ; Tratnik, Niko ; Žigert Pleteršek, Petra
Saturation number of lattice animals // ARS Mathematica Contemporanea, 15 (2018), 191-204
Podaci o odgovornosti
Došlić, Tomislav ; Tratnik, Niko ; Žigert Pleteršek, Petra
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
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
Povezanost rada
Povezane osobe
Povezane ustanove