Aineistot 1-1 / 1
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 ...