Connected minimum secure-dominating sets in grids

DOI10.1016/j.akcej.2017.03.003zbMath1375.05191OpenAlexW2599377687MaRDI QIDQ1680872

Cadavious Jones, Egbert Mujuni, Ryan Matzke, Adam Blumenthal, Johnathan Barnett, Peter D. jun. Johnson

Publication date: 17 November 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.03.003

zbMATH Keywords

dominating setshub setssecurity in graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Secure domination of honeycomb networks ⋮ Secure domination of some graph operators ⋮ Security in Sierpiński graphs ⋮ An explicit construction of optimal dominating and [1, 2–dominating sets in grid]

Cites Work

• Integer and fractional security in graphs
• The connected hub number and the connected domination number

This page was built for publication: Connected minimum secure-dominating sets in grids