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...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
University of Zielona Góra
2021-11-01
|
| Saila: | Discussiones Mathematicae Graph Theory |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.7151/dmgt.2260 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|