The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found applications in optimization, navigation, network theory, image processing, pattern recognition etc. Several other authors have studied metric dimension of various standard graphs. In this paper we introduce a real valued function called generalized metric → + Gd : X × X × X R where X = r(v /W) = {(d(v,v1 ),d(v,v2 ),...,d(v,vk /) v∈V (G))}, denoted Gd and is used to study metric dimension of graphs. It has been proved that metric dimension of any connected finite simple graph remains constant if Gd numbers of pendant edges are added to the non-basis vertices
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G)...
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimens...
Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A...
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found ...
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found ...
Metric dimension or location number is a generalization of affine dimension to arbitrary metric spac...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
As a generalization of the concept of a metric basis, this article introduces the notion of k-metric...
A metric basis for a digraph G(V, A) is a set W⊂V such that for each pair of vertices u and v of V, ...
Let G = ( V ( G ) , E ( G ) ) be a connected graph. An ordered set W ⊂ V ( G ) i...
In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of grap...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
Click on the link to view the abstract.Keywords: Resolving set, metric dimension, generalized Peters...
Copyright c ⃝ 2014 Raghavendra, Sooryanarayana and Hegde. This is an open access article distributed...
The metric dimension has been introduced independently by Harary, Melter [HM75] and Slater [Sla75] i...
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G)...
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimens...
Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A...
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found ...
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found ...
Metric dimension or location number is a generalization of affine dimension to arbitrary metric spac...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
As a generalization of the concept of a metric basis, this article introduces the notion of k-metric...
A metric basis for a digraph G(V, A) is a set W⊂V such that for each pair of vertices u and v of V, ...
Let G = ( V ( G ) , E ( G ) ) be a connected graph. An ordered set W ⊂ V ( G ) i...
In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of grap...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
Click on the link to view the abstract.Keywords: Resolving set, metric dimension, generalized Peters...
Copyright c ⃝ 2014 Raghavendra, Sooryanarayana and Hegde. This is an open access article distributed...
The metric dimension has been introduced independently by Harary, Melter [HM75] and Slater [Sla75] i...
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G)...
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimens...
Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A...