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...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
University of Zielona Góra
2021-11-01
|
| Серія: | Discussiones Mathematicae Graph Theory |
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.7151/dmgt.2260 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|