New results on metric-locating-dominating sets of graphs
Tipus de documentReport de recerca
Condicions d'accésAccés obert
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominatin g sets to other special sets: resolving sets, dominating sets, locating-dominating set s and doubly resolving sets. We first characterize classes of trees according to cer tain relationships between their metric-location-domination number and thei r metric dimension and domination number. Then, we show different methods to tran sform metric- locating-dominating sets into locating-dominating sets a nd doubly resolving sets. Our methods produce new bounds on the minimum cardinalities of all those sets, some of them involving parameters that have not been related so far
CitacióHernando, M., Mora, M., González, A. "New results on metric-locating-dominating sets of graphs". 2016.
Versió de l'editorhttps://arxiv.org/pdf/1604.03861v1.pdf