@misc{10498/30889,
year = {2017},
month = {12},
url = {http://hdl.handle.net/10498/30889},
abstract = {Let $G=(V,E)$ be a connected graph. A vertex $w\in V$ distinguishes two elements (vertices or edges) $x,y\in E\cup V$ if $d_G(w,x)\ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator for $G$ if every two elements (vertices or edges) of $G$ are distinguished by some vertex of $S$. The smallest cardinality of a mixed metric generator for $G$ is called the mixed metric dimension and is denoted by $\mdim(G)$. In this paper we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial lower and upper bounds. We also give results about the mixed metric dimension of some families of graphs and present an upper bound with respect to the girth of a graph. Finally, we prove that the problem of determining the mixed metric dimension of a graph is NP-hard in the general case.},
publisher = {Elsevier},
keywords = {mixed metric dimension},
keywords = {edge metric dimension},
keywords = {metric dimension},
title = {Mixed metric dimension of graphs},
doi = {10.1016/j.amc.2017.07.027},
author = {Kelenc, Aleksander and Kuziak, Dorota and Taranenko, Andrej and González Yero, Ismael},
}