On Adjacency Metric Dimension of Some Families of Graph. (25th June 2022)

• Record Type: Journal Article
• Authors: Koam, Ali N. A.; Ahmad, Ali; Azeem, Muhammad; Khalil, Adnan; Nadeem, Muhammad Faisal
• Other Names: Gulzar Muhammad Academic Editor.
• Is Part Of: Journal of function spaces. Volume 2022(2022)
• Publication Date: 2022-06-25
• Subjects: Function spaces -- Periodicals; 515.7305
• DOI: 10.1155/2022/6906316
• Languages: English
• ISSNs: 2314-8896

Abstract

Abstract : Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Q a ⊂ V G is considered to be an adjacency metric generator for G if u 1, u 2 ∈ V \ Q a (supposing each pair); there must exist a vertex q ∈ Q a along with the condition that q is indeed adjacent to one of u 1, u 2 . The minimum number of elements in adjacency metric generator is the adjacency metric dimension of G, denoted by di m a G . In this work, we compute exact values of the adjacency metric dimension of circulant graph C n 1, 2, Möbius ladder, hexagonal Möbius ladder, and the ladder graph.