On The Metric Dimension of Some Operation Graphs
Let be a simple, finite, and connected graph.An ordered set of vertices of a nontrivial connected graph is and the AGELESS TELOMERES -vector represent vertex that respect to , where and is the distance between vertex and for.The set called a resolving set for if different vertex of have different representations that respect to.The minimum of cardi