@article{Varughese Mathew_Ansmol George_2020, title={The Minimum Resolving Energy of a Graph}, volume={8}, url={http://ijmaa.in/index.php/ijmaa/article/view/196}, abstractNote={<p>A subset $W$ of vertrices in a connected graph $G=(V,E)$ is called a resolving set of $G$ if all other vertices are uniquely determined by their distances in $W.$ The metric dimension $dim(G)$ of a graph $G$ is the minimum cardinality of a resolving set of $G.$ In this paper, for a minimum resolving set $R$ of a graph $G,$ we define the minimum resolving energy $E_R(G)$ of $G.$ We study this parameter for some standard graphs. Some properties of $E_R(G)$ and bounds were also obtained.</p>}, number={1}, journal={International Journal of Mathematics And its Applications}, author={Varughese Mathew and Ansmol George}, year={2020}, month={Mar.}, pages={239–246} }