@Article{Blidia2009,
author = "Blidia, Mostafa and Lounes, Rahma",
title = "Vertices belonging to all or to no minimum locating dominating sets of trees",
journal = "Opuscula Math.",
year = "2009",
volume = "29",
number = "1",
pages = "5--14",
doi = "http://dx.doi.org/10.7494/OpMath.2009.29.1.5",
url = "http://dx.doi.org/10.7494/OpMath.2009.29.1.5",
abstract = "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.",
keywords = "domination, locating domination",
issn = "1232-9274"
}