Sciweavers

ARSCOM
2008
192views more  ARSCOM 2008»
13 years 5 months ago
Bounds on the metric and partition dimensions of a graph
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...
Glenn G. Chappell, John G. Gimbel, Chris Hartman