Abstract

A vertex v∈V(G)v\in V(G) is said to distinguish two vertices x,y∈V(G)x,y\in V(G) of a nontrivial connected graph GG if the distance from vv to xx is different from the distance from vv to yy. A set S⊂V(G)S\subset V(G) is a local metric generator for GG if every two adjacent vertices of GG are distinguished by some vertex in SS. A local metric generator with the minimum cardinality is called a local metric basis for GG 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.