Cost Effective Domination in Graphs
A set S of vertices in a graph G = (V,E) is a dominating set if every vertex in V \ S is adjacent to at least one vertex in S. A vertex v in a dominating set S is said to be it cost effective if it is adjacent to at least as many vertices in V \ S as it is in S. A dominating set S is cost effective...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2012
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/1485 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2678&context=etd |