Perfect domination ratios of Archimedean lattices (Q2088708)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect domination ratios of Archimedean lattices |
scientific article; zbMATH DE number 7596729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect domination ratios of Archimedean lattices |
scientific article; zbMATH DE number 7596729 |
Statements
Perfect domination ratios of Archimedean lattices (English)
0 references
6 October 2022
0 references
Summary: An Archimedean lattice is an infinite graph constructed from a vertex-transitive tiling of the plane by regular polygons. A dominating set of vertices is a perfect dominating set if every vertex that is not in the set is dominated exactly once. The perfect domination ratio is the minimum proportion of vertices in a perfect dominating set. Seven of the eleven Archimedean lattices can be efficiently dominated, which easily determines their perfect domination ratios. The perfect domination ratios are determined for the four Archimedean lattices that can not be efficiently dominated.
0 references
vertex-transitive tiling of the plane by regular polygons
0 references
perfect domination ratio
0 references
0 references
0 references
0.8608733
0 references
0.8591628
0 references
