Given a graph $G$, a set $W$ of vertices of $G$ is a resolving set if, for any pair of vertices $z_1$ and $z_2$ of $G$, there is a vertex $w\in W$ such that $d(w,z_1)\ne d(w,z_2)$, where $d(u,v)$ denotes the length of a shortest path between the vertices $u$ and $v$. The metric dimension of a graph $G$, $\beta(G)$, is...
C. Hernando, M. Maureso, M. Mora et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.