Bounds on cost effective domination numbers

DOI10.2989/16073606.2016.1167133zbMath1423.05123OpenAlexW2506332991MaRDI QIDQ5236029

Teresa W. Haynes, T. L. McCoy, Stephen T. Hedetniemi, Tony K. Rodriguez

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2016.1167133

zbMATH Keywords

dominationcost effective setsvery cost effective sets

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Client-server and cost effective sets in graphs ⋮ Alliances and Related Domination Parameters

Cites Work

• Unfriendly partitions of a graph
• Algorithmic approach to the satisfactory graph partitioning problem
• The satisfactory partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on cost effective domination numbers