The Compared Costs of Domination Location-Domination and Identification

Autor: Hudry Olivier, Lobstein Antoine

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 127-147 (2020)

Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-lo

Externí odkaz: https://doaj.org/article/7ea9e6278c3d4d6383a27f28986cb899

The compared costs of domination, location-domination and identification

Autor: Olivier Hudry, Antoine Lobstein

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 127-147 (2020)
Discussiones Mathematicae Graph Theory
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩

International audience; Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V , let B r (v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V , we have B r (v

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a9073f2bd839e7926901764b5bfea92
https://doi.org/10.7151/dmgt.2129

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.