The metric dimension is quite a well-studied graph parameter. Recently, the adjacency metric dimension and the local metric dimension have been introduced. We combine these variants and introduce the local adjacency metric dimension. We show that the (local) metric dimension of the corona product of a graph of order n and some non-trivial graph H equals n times the (local) adjacency metric dimension of H. This strong relation also enables us to infer computational hardness results for computing the (local) metric dimension, based on according hardness results for (local) adjacency metric dimension that we also give. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Fernau, H., & Rodríguez-Velázquez, J. A. (2014). Notions of metric dimension of corona products: Combinatorial and computational results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8476 LNCS, pp. 153–166). Springer Verlag. https://doi.org/10.1007/978-3-319-06686-8_12
Mendeley helps you to discover research relevant for your work.