Computing the Metric Dimension of Gear Graphs

Computing the Metric Dimension of Gear Graphs

Let G = (V, E) be a connected graph and d(u, v) denote the distance between the vertices u and v in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set...

Full description

Bibliographic Details
Main Authors: Shahid Imran, Muhammad Kamran Siddiqui, Muhammad Imran, Muhammad Hussain, Hafiz Muhammad Bilal, Imran Zulfiqar Cheema, Ali Tabraiz, Zeeshan Saleem
Format: Article
Language:English
Published: MDPI AG 2018-06-01
Series:Symmetry
Subjects:
Metric dimension
basis
resolving set
gear graph
generalized gear graph
Online Access:http://www.mdpi.com/2073-8994/10/6/209

Similar Items

Similar Items