Computing the metric dimension of kayak paddles graph and cycles with chord
Author
Ahmad, Ali
Bača, Martin
Sultan, Saba
Abstract
A set of vertices W is a resolving set of a graph G if every two vertices of G have distinct representations of distances with respect to the set W. The number of vertices in a smallest resolving set is called the metric dimension. This invariant has extensive applications in robotics, since the metric dimension can represent the mínimum number of landmarks, which uniquely determine the position of a robot moving in a graph space. Finding the metric dimension of a graph is an NP-hard problem. We present exact values of the metric dimensión of Kayak Paddles graph and Cycles with chord.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Graceful centers of graceful graphs and universal graceful graphs.
Makadia, H. M.; Karavadiya, H. M.; Kaneria, V. J.. Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 305-314 -
Equitable Graph of a Graph
Dharmalingam, Kuppusamy Makandan. Proyecciones. Journal of Mathematics; Vol 31 No 4 (2012); 363-372 -
Irregularity indices for line graph of Dutch windmill graph
Mohammed, Mohanad A.; AL-Mayyahi, Suad Younus A. AL-Mayyahi; Virk, Abaid ur Rehman; Rehman, Hafiz Mutee ur. Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 903-918