Record Details

The Metric Dimension of Graph with Pendant Edges

Ubaya Repository

View Archive Info
 
 
Field Value
 
Relation http://repository.ubaya.ac.id/167/
 
Title The Metric Dimension of Graph with Pendant Edges
 
Creator Iswadi, Hazrul
Baskoro, Edy Tri
Simanjuntak, Rinovia
Salman, A.N.M
 
Subject QA Mathematics
 
Description 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.
 
Publisher Charles Babbage Research Center
 
Date 2008
 
Type Article
PeerReviewed
 
Format application/pdf
 
Language en
 
Identifier /167/1/The%20Metric%20Dimension%20of%20Graph%20with%20Pendant%20Edges%20-%20Abstract%20Repository.pdf
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