Independent resolving sets in graphs. Issue 2 (4th May 2021)

• Record Type: Journal Article
• Authors: Suganya, B.; Arumugam, S.
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 18:Issue 2(2021)
• Page Start: 106
• Page End: 109
• Publication Date: 2021-05-04
• Subjects: Resolving set -- independent resolving set -- metric dimension -- corona -- Cartesian product; 05C12
• DOI: 10.1080/09728600.2021.1963643
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: Let G = ( V, E ) be a connected graph. Let W = { w 1, w 2, …, w k } be a subset of V with an order imposed on W . The k -vector r ( v | W ) = ( d ( v, w 1 ), d ( v, w 2 ), …, d ( v, w k ) ) is called the resolving vector of v with respect to W . The set W is called a resolving set if r ( v | W ) ≠ r ( u | W ) for any two distinct vertices u, v ∈ V . In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.