Resolvability and the upper dimension of
✍
G. Chartrand; C. Poisson; P. Zhang
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 832 KB
For an ordered set W = (~1, ~2,. , wk} of vertices and a vertex 2) in a connected graph G, the (metric) representation of v with respect to W is the /c-vector T(V 1 W) = (d(v,wl), d(v, wz), , d(v, wk)), where d(z, y) represents the distance between the vertices z and y. The set IV is a resolving set