Cost effective domination in graphs

zbMATH Open1278.05171MaRDI QIDQ2869348FDOQ2869348

Authors: Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Tabitha L. McCoy, Inna Vasylieva 

Publication date: 3 January 2014

Published in: Congressus Numerantium (Search for Journal in Brave)

Recommendations

• Bounds on cost effective domination numbers
• Cost effective domination in the join, corona and composition of graphs
• Client-server and cost effective sets in graphs
• scientific article; zbMATH DE number 4085682
• Weighted efficient domination problem on some perfect graphs

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Very cost effective bipartitions in graphs
• Bounds on cost effective domination numbers
• Alliances and Related Domination Parameters
• Client-server and cost effective sets in graphs
• On k-cost effective domination in the corona and lexicographic product of graphs and its variant

This page was built for publication: Cost effective domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869348)