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

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, sinc...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Ahmad,Ali, Bača,Martin, Sultan,Saba
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2020
Materias:	Metric dimension Resolving set Kayak paddles Robotics
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000200287
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172020000200287
record_format	dspace
spelling	oai:scielo:S0716-091720200002002872020-05-06Computing the metric dimension of Kayak Paddles graph and Cycles with chordAhmad,AliBača,MartinSultan,Saba Metric dimension Resolving set Kayak paddles Robotics 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.39 n.2 20202020-04-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000200287en10.22199/issn.0717-6279-2020-02-0018
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Metric dimension Resolving set Kayak paddles Robotics
spellingShingle	Metric dimension Resolving set Kayak paddles Robotics Ahmad,Ali Bača,Martin Sultan,Saba Computing the metric dimension of Kayak Paddles graph and Cycles with chord
description	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.
author	Ahmad,Ali Bača,Martin Sultan,Saba
author_facet	Ahmad,Ali Bača,Martin Sultan,Saba
author_sort	Ahmad,Ali
title	Computing the metric dimension of Kayak Paddles graph and Cycles with chord
title_short	Computing the metric dimension of Kayak Paddles graph and Cycles with chord
title_full	Computing the metric dimension of Kayak Paddles graph and Cycles with chord
title_fullStr	Computing the metric dimension of Kayak Paddles graph and Cycles with chord
title_full_unstemmed	Computing the metric dimension of Kayak Paddles graph and Cycles with chord
title_sort	computing the metric dimension of kayak paddles graph and cycles with chord
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2020
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000200287
work_keys_str_mv	AT ahmadali computingthemetricdimensionofkayakpaddlesgraphandcycleswithchord AT ba269amartin computingthemetricdimensionofkayakpaddlesgraphandcycleswithchord AT sultansaba computingthemetricdimensionofkayakpaddlesgraphandcycleswithchord
_version_	1718439867707293696

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

Ejemplares similares