Hae
Aineistot 1-3 / 3
On using distances to locate vertices: resolving sets and metric bases of graphs, two generalisations and their forced vertices
(Turun yliopisto, 2021-06-18)
A graph consists of vertices that are connected by edges. A resolving set of a graph is a subset of its vertices that gives a unique combination of distances to every vertex of the graph. We can use the distances we are ...
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 ...
Resolving sets and resolving several objects in the finite king grid
(Turun yliopisto, 2017-09-19)
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 ...