On locating-domination in graphs
Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 2, pp. 223-235

Voir la notice de l'article provenant de la source Library of Science

A set D of vertices in a graph G = (V,E) is a locating-dominating set (LDS) if for every two vertices u,v of V-D the sets N(u)∩ D and N(v)∩ D are non-empty and different. The locating-domination number γ_L(G) is the minimum cardinality of a LDS of G, and the upper locating-domination number, Γ_L(G) is the maximum cardinality of a minimal LDS of G. We present different bounds on Γ_L(G) and γ_L(G).
Keywords: upper locating-domination number, locating-domination number
@article{DMGT_2010_30_2_a2,
     author = {Chellali, Mustapha and Mimouni, Malika and Slater, Peter},
     title = {On locating-domination in graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {223--235},
     publisher = {mathdoc},
     volume = {30},
     number = {2},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a2/}
}
TY  - JOUR
AU  - Chellali, Mustapha
AU  - Mimouni, Malika
AU  - Slater, Peter
TI  - On locating-domination in graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2010
SP  - 223
EP  - 235
VL  - 30
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a2/
LA  - en
ID  - DMGT_2010_30_2_a2
ER  - 
%0 Journal Article
%A Chellali, Mustapha
%A Mimouni, Malika
%A Slater, Peter
%T On locating-domination in graphs
%J Discussiones Mathematicae. Graph Theory
%D 2010
%P 223-235
%V 30
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a2/
%G en
%F DMGT_2010_30_2_a2
Chellali, Mustapha; Mimouni, Malika; Slater, Peter. On locating-domination in graphs. Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 2, pp. 223-235. http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a2/