Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices

DOI10.1007/978-3-031-05375-7_15zbMath1500.05051OpenAlexW4295836559MaRDI QIDQ2089545

John C. Wierman, Nathan Vallapureddy, Lyle Paskowitz

Publication date: 22 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05375-7_15

zbMATH Keywords

integer programmingefficient dominationArchimedean lattices

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Structure theory of lattices (06B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Domination with exponential decay
• Tight bounds for eternal dominating sets in graphs
• Power domination in graphs

This page was built for publication: Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices