For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v, w1), d(v, w2), . . . , d(v, wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respe...

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 set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric dimension of cartesian products G H. We prove that the metric dimension of G G is tied in a strong sense to the minimum order of a so-called doubly resolving set ...

In this paper, we apply the idea of integral type contraction and prove some coupled fixed point theorems for such contractions in ordered $G$-metric space. Also, we support the main results by an illustrative example.

Let G be a (totally) ordered (abelian) group. A Gmetric space (X, p) consists of a nonempty set A"and a G-metric />: XxX->-G (satisfying the usual axioms of a metric, with G replacing the ordered group of real numbers). That the amalgamation property holds for the class of all metric spaces is attributed, by Morley and Vaught, to Sierpiñski. The following theorem is proved. Theorem. The class o...

In this paper, we give some xed point theorems for '-weak contractivetype mappings on complete G-metric space, which was given by Zaed andSims [1]. Also a homotopy result is given.

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. 2 ) ( = G β ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever 2 ) (...

We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.