Imbalances in authorship, geographic and institutional contexts, and funding sources in research on gender approaches to sexual and reproductive health in Africa: a scoping review. [PDF]
Sex Reprod Health MattersAmde W +4 more
europepmc +1 more source
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations [PDF]
Electronic Notes in Theoretical Computer Science, 2019 International audienceThe problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to ...
Annegret K Wagler
exaly +2 more sources
Fault-tolerant locating-dominating sets
Discrete Mathematics, 2002 For facilities safeguards problems in which one is interested in detecting the presence of, and determining the exact location of, an intruder, and for determining an inoperable component in a processor network, locating-dominating sets are of interest ...
Peter J Slater
exaly +2 more sources
An optimal locating-dominating set in the infinite triangular grid
Discrete Mathematics, 2006 Assume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the set of all elements of C that are within distance one from v.
Iiro Honkala
exaly +2 more sources
Locating and paired-dominating sets in graphs
Discrete Applied Mathematics, 2009 In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206].
Michael A Henning
exaly +2 more sources
A polyhedral approach to locating-dominating sets in graphs
Electronic Notes in Discrete Mathematics, 2015 International audienceThe locating-dominating set problem is a special domination problem, challenging both from a theoretical and a computational point of view.
Gabriela R Argiroffo +2 more
exaly +1 more source
A note on locating-dominating sets in twin-free graphs
Discrete MathematicsIn this short note, we prove that every twin-free graph on n vertices contains a locating-dominating set of size at most ⌈[Formula presented]n⌉. This improves the earlier bound of ⌊[Formula presented]n⌋ due to Foucaud, Henning, Löwenstein and Sasse from ...
VÍCTOR Falgas–Ravry, Laure Morelle
exaly +2 more sources
Related searches:
Locating-dominating sets: From graphs to oriented graphs
Discrete Mathematics, 2023Tuomo Lehtilä, Aline Parreau
exaly
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science, 2003Irène Charon, Antoine Lobstein
exaly