TY  - GEN 
AU  - Hakanen, Anni
AU  - Junnila, Ville
AU  - Laihonen, Tero
AU  - González Yero, Ismael
A4  - Matemáticas
PY  - 2021
SN  - 0166-218X
UR  - http://hdl.handle.net/10498/29356
AB  - A set R⊆V(G) is a resolving set of a graph G if for all distinct vertices v,u∈V(G) there exists an element r∈R such that d(r,v)≠d(r,u). The metric dimension dim(G) of the graph G is the cardinality of a smallest resolving set of G. A resolving set...
LA  - eng
PB  - Elsevier
KW  - Cut-vertex
KW  - Forced vertex
KW  - Metric basis
KW  - Metric dimension
KW  - NP-hard
KW  - Pendant
KW  - Resolving set
KW  - Unicyclic graph
TI  - On vertices contained in all or in no metric basis
DO  - 10.1016/j.dam.2021.12.004
ER  -