Algorithmic Aspects of Secure Connected Domination in Graphs
Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating set of G. The minimum size of a secure connecte...
| Main Authors: | , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
University of Zielona Góra
2021-11-01
|
| 丛编: | Discussiones Mathematicae Graph Theory |
| 主题: | |
| 在线阅读: | https://doi.org/10.7151/dmgt.2260 |