A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
<div class="standard"><a id="magicparlabel-29">The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m, r, s E N. Resolving set of a graph G is a subset of F (G) that its distance representation is distinct to all vertices of graph G. Resolving set with minimum cardinality is called minimum resolvingdoi:10.18860/ca.v1i4.1800 fatcat:j2e3lk6zrrhbxhfwjz7rrnt2ky