a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

in this paper, we study projective randers change and c-conformal change of p-reduciblemetrics. then we show that every p-reducible generalized landsberg metric of dimension n  2 must be alandsberg metric. this implies that on randers manifolds the notions of generalized landsberg metric andberwald metric are equivalent.

Given a connected graph G, the metric (resp. edge metric) dimension of G is cardinality smallest ordered set vertices that uniquely identifies every pair distinct edges) by means distance vectors to such set. In this work, we settle three open problems on (edge) graphs. Specifically, show for r,t?2 with r?t, there n0, n?n0 exists order n r and t, which among other consequences, shows existence ...