Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903469 | Electronic Notes in Discrete Mathematics | 2017 | 11 Pages |
Abstract
For a graph G = (V, E), a set WâV is a resolving set if for each pair of distinct vertices v1,v2âV there is a vertex wâW such that d(v1,w)â d(v2,w). A minimum resolving set or basis for G is a resolving set containing a minimum number of vertices and the cardinality of a minimum resolving set is called the metric dimension of G and is denoted by dim(G). In this paper, we investigates the metric dimension of Kn+Op, Pn+Op and K1,n+Op, where Op denotes the empty (isolated) graph of order p.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A.T. Shahida, M.S. Sunitha,