11 search results - page 3 / 3 » dw 2008 |
ARSCOM
2008
13 years 4 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...