TY  - JOUR
ID  - Blidia2009
LB  - Blidia2009
AU  - Blidia, Mostafa
AU  - Lounes, Rahma
TI  - Vertices belonging to all or to no minimum locating dominating sets of trees
ST  - Vertices belonging to all or to no minimum locating dominating sets of trees
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2009
VL  - 29
IS  - 1
SP  - 5
EP  - 14
DO  - http://dx.doi.org/10.7494/OpMath.2009.29.1.5
UR  - http://dx.doi.org/10.7494/OpMath.2009.29.1.5
AB  - A set \(D\) of vertices in a graph \(G\) is a locating-dominating set if for every two vertices \(u\), \(v\) of \(G \setminus D\) the sets \(N(u) \cap D\) and \(N(v) \cap D\) are non-empty and different. In this paper, we characterize vertices that are in all or in no minimum locating dominating sets in trees. The characterization guarantees that the \(\gamma_L\)-excellent tree can be recognized in a polynomial time.
KW  - domination
KW  - locating domination
SN  - 1232-9274
ER  -