On metric dimension of P(n, 2)ʘK1 graph. (17th February 2021)

• Record Type: Journal Article
• Authors: Ahmad, Zubair; Chaudhary, Maqbool Ahmad; Baig, Abdul Qudair; Zahid, Manzoor Ahmad
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 24:Number 2(2021)
• Page Start: 629
• Page End: 645
• Publication Date: 2021-02-17
• Subjects: 05C12; Metric dimension -- Basis -- Resolving set -- Corona product -- Petersen graph; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2021.1907017
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: For a connected graph G, a subset W = { w 1, w 2, w 3, … , wξ } of the vertices of G is the resolving set for G if for a, b ∈ V ( 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)ʘ K 1 .