Simultaneous Resolvability in Families of Corona Product Graphs
arXiv:1506.05667 · doi:10.1007/s40840-016-0412-5
Abstract
Let be a graph family defined on a common vertex set and let be a distance defined on every graph . A set is said to be a simultaneous metric generator for if for every and every pair of different vertices there exists such that . The simultaneous metric dimension of is the smallest integer such that there is a simultaneous metric generator for of cardinality . We study the simultaneous metric dimension of families composed by corona product graphs. Specifically, we focus on the case of two particular distances defined on every , namely, the geodesic distance and the distance defined as .
arXiv commentarXiv admin note: substantial text overlap with arXiv:1504.00492
References in corpus (6)
- On the metric dimension of corona product graphs
- On the strong metric dimension of corona product graphs and join graphs
- On the fractional metric dimension of corona product graphs and lexicographic product graphs
- The Simultaneous Metric Dimension of Graph Families
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs