Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Metric-locating-dominating sets of graphs for constructing related subsets of vertices

Autor
Hernando, M.; Mora, M.; González, A.
Tipus d'activitat
Article en revista
Revista
Applied mathematics and computation
Data de publicació
2018-09-01
Volum
332
Pàgina inicial
449
Pàgina final
456
DOI
https://doi.org/10.1016/j.amc.2018.03.053 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/116408 Obrir en finestra nova
URL
https://www.sciencedirect.com/science/article/pii/S0096300318302261 Obrir en finestra nova
Resum
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S , and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first charact...
Citació
Hernando, M., Mora, M., González, A. Metric-locating-dominating sets of graphs for constructing related subsets of vertices. "Applied mathematics and computation", 1 Setembre 2018, vol. 332, p. 449-456.
Paraules clau
Metric-locating-dominating set, dominating set, doubly resolving set, locating-dominating set, resolving set
Grup de recerca
DCG - Discrete and Combinatorial Geometry

Participants