22
Views
2
CrossRef citations to date
0
Altmetric
Research Article

On metric dimension of P(n, 2)ʘK1 graph

, , &
 

Abstract

For a connected graph G, a subset W = {w1, w2, w3, … , wξ} of the vertices of G is the resolving set for G if for a, bV(G), we have d(a, wξ) ≠ d(b, wξ) for all wξW. Metric basis for G is the minimum number of vertices in W and metric dimension is the cardinality of such a set denoted by β (G). In this paper we compute the metric dimension of P(n, 2)ʘK1.

Subject Classification:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.