Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
