Computing the metric dimension of Kayak Paddles graph and cycles with chord

Ali Ahmad, Martin Bača, Saba Sultan

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

31 Citas (Scopus)

Resumen

A set of vertices Wis a resolving set of a graph G if every two vertices ofG 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 minimum 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 dimension of Kayak Paddles graph and Cycles with chord.

Idioma originalInglés
Páginas (desde-hasta)287-300
Número de páginas14
PublicaciónProyecciones
Volumen39
N.º2
DOI
EstadoPublicada - 2020
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Computing the metric dimension of Kayak Paddles graph and cycles with chord'. En conjunto forman una huella única.

Citar esto