On the 2-metric resolvability of graphs
Let $G=(V(G),E(G))$ be a graph. An ordered set of vertices $\Re=\{v_1,v_2,\ldots,v_l\}$ is a $2-$resolving set for $G$ if for any distinct vertices $s,w \in V(G)$, the representation of vertices $r(s|\Re)=(d_G(s,v_1),\ldots,d_G(s,v_l))$ and $r(w|\Re)=(d_G(w,v_1),\ldots, d_G(w,v_l))$ differs in at le...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2020-08-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/10.3934/math.2020425/fulltext.html |