Alternative parameterizations of Metric Dimension

27 Apr 2018 Gutin Gregory Ramanujan M. S. Reidl Felix Wahlström Magnus

A set of vertices $W$ in a graph $G$ is called resolving if for any two distinct $x,y\in V(G)$, there is $v\in W$ such that ${\rm dist}_G(v,x)\neq{\rm dist}_G(v,y)$, where ${\rm dist}_G(u,v)$ denotes the length of a shortest path between $u$ and $v$ in the graph $G$. The metric dimension ${\rm md}(G)$ of $G$ is the minimum cardinality of a resolving set... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS