The Minimum Resolving Energy of a Graph
Abstract views: 25 / PDF downloads: 25
Keywords:Minimum resolving set, metric dimension, minimum resolving matrix, minimum resolving eigenvalue, minimum resolving energy of a graph
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.
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.