Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"cost effective domination"”.
-
Cost Effective Domination in Graphs
… a dominating set <em>S</em> is said to be it <em>cost effective</em> if it is adjacent to at least as many vertices in <em>V</em> \ <em>S</em> as it is in <em>S</em>. A dominating set S is cost effective if every vertex in S is cost effective. The minimum cardinality of a cost effective dominating …