The cost of edge removal in graph domination
A vertex set D of a graph G is a dominating set of G if each vertex of G is a member of D or is adjacent to a member of D. The domination number of G, denoted by is the cardinality of a smallest dominating set of G. In this paper two cost functions, and are considered which measure respectively the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.004 |