On the local metric dimension of corona product graphs
Combinatorics
2016-02-17 v2
Abstract
A vertex is said to distinguish two vertices of a nontrivial connected graph if the distance from to is different from the distance from to . A set is a local metric generator for if every two adjacent vertices of are distinguished by some vertex in . A local metric generator with the minimum cardinality is called a local metric basis for and its cardinality, the local metric dimension of G. In this paper we study the problem of finding exact values for the local metric dimension of corona product of graphs.
Cite
@article{arxiv.1308.6689,
title = {On the local metric dimension of corona product graphs},
author = {Juan A. Rodriguez-Velazquez and Gabriel A. Barragan-Ramirez and Carlos Garcia Gomez},
journal= {arXiv preprint arXiv:1308.6689},
year = {2016}
}