The Metric Dimension of Graph with Pendant Edges

Iswadi, Hazrul and Baskoro, Edy Tri and Simanjuntak, Rinovia and Salman, A.N.M (2008) The Metric Dimension of Graph with Pendant Edges. The Journal of Combinatorial Mathematics and Combinatorial Computing, 65. pp. 139-145. ISSN 0835-3026

This is the latest version of this item.

[thumbnail of hazrul_The Metric Dimension of Graph with Pendant Edges_2008.pdf]
hazrul_The Metric Dimension of Graph with Pendant Edges_2008.pdf

Download (151kB) | Preview


For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2),..., d(v,w_k)) where d(x,y) represents the distance between the vertices x and y. The set W is called a resolving set for G if every two vertices of G have distinct representations. A resolving set containing a minimum number of vertices is called a basis for G. The dimension of G, denoted by dim(G), is the number of vertices in a basis of G. In this paper, we determine the dimensions of some corona graphs G⊙K_1, and G⊙K_m for any graph G and m ≥ 2, and a graph with pendant edges more general than corona graphs G⊙K_m.

Item Type: Article
Uncontrolled Keywords: Resolving sets, metric dimension, corona graph
Subjects: Q Science > QA Mathematics
Divisions: Academic Department > Department of Mathematics and Natural Science
Depositing User: Hazrul Iswadi 6179
Date Deposited: 08 Mar 2012 07:57
Last Modified: 20 Mar 2012 01:38

Available Versions of this Item

Actions (login required)

View Item View Item