Hae
Aineistot 1-1 / 1
Resolving sets and resolving several objects in the finite king grid
(Turun yliopisto, 2017-09-22)
An l-resolving set of a graph G is a set of vertices that has a unique array of distances to all vertex sets of G with up to l elements. The smallest cardinality of such a set is called the l-set-metric dimension of G. In ...