Perfect Domination Ratios of Archimedean Lattices

Autor:	Yunfan Zhao, John C Wierman, Thomas G. Marge
Rok vydání:	2022
Předmět:	Computational Theory and Mathematics Applied Mathematics Discrete Mathematics and Combinatorics Geometry and Topology Theoretical Computer Science
Zdroj:	The Electronic Journal of Combinatorics. 29
ISSN:	1077-8926
DOI:	10.37236/10210
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9f4a8f7c452292952876be358142f948 https://doi.org/10.37236/10210 Zobrazit plný text záznamu