Perfect Domination Ratios of Archimedean Lattices

Yunfan Zhao,John C. Wierman, Thomas G. Marge

ELECTRONIC JOURNAL OF COMBINATORICS(2022)

引用 0|浏览11
暂无评分
摘要
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 domi-nating 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.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要