Matroids with bases as minimal resolving sets of graphs
Matroids with bases as minimal resolving sets of graphs
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on the matroid can be used to find the minimum-cost resolving set of weighted graphs, …