pith. sign in

arxiv: 1308.6689 · v2 · pith:LXFHOWUOnew · submitted 2013-08-30 · 🧮 math.CO

On the local metric dimension of corona product graphs

classification 🧮 math.CO
keywords localmetricdimensioncardinalitycoronadistancegeneratorgraphs
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.