A Resolving set R for a graph G is a subset of vertex set V(G) of G such that any two vertices in G can be uniquely identified by the vector of distances to elements in R. Any resolving set M with minimum cardinality is called Metric Basis of G. The cardinality of M is called the metric dimension of G. This problem is NP Complete and is open for many graphs. It is found in the literature that this concepts has many applications in Microbiology- Metagenomics-Microbial Species interaction Networks ,...etc. The full literature survey on this research problem can be found in the following link.
Article Getting the Lay of the Land in Discrete Space: A Survey of M...
Graph theory researcher can able to find metric dimension of any graph by research, and how his/her findings helpful for researchers working in Microbiology / Biological sequencing /Metagenomics (Microbial Species Interaction Networks),...etc ?