Author, as appears in the article.: C. García-Gómez; A. Estrada-Moreno; Y. Ramírez-Cruz; J. A. Rodríguez-Velázquez
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: GARCÍA GÓMEZ, CARLOS; A. Estrada-Moreno; Y. Ramírez-Cruz; RODRÍGUEZ VELÁZQUEZ, JUAN ALBERTO
Keywords: Strong metric dimension Simultaneous metric dimension
Abstract: Let G be a family of graphs defined on a common (labelled) vertex set V. A set S¿ V is said to be a simultaneous strong metric generator for G if it is a strong metric generator for every graph of the family. The minimum cardinality among all simultaneous strong metric generators for G, denoted by Sd s(G) , is called the simultaneous strong metric dimension of G. We obtain general results on Sd s(G) for arbitrary families of graphs, with special emphasis on the case of families composed by a graph and its complement. In particular, it is shown that the problem of finding the simultaneous strong metric dimension of families of graphs is NP-hard, even when restricted to families of trees.
Research group: Matemática Discreta
Thematic Areas: Computer engineering Ingeniería informática Enginyeria informàtica
licence for use: https://creativecommons.org/licenses/by/3.0/es/
ISSN: 0126-6705
Author identifier: 0000-0002-1634-6001*; 0000-0001-9767-2177; 0000-0002-1750-5756; 0000-0002-9082-7647
Record's date: 2016-07-11
Last page: 192
Papper version: info:eu-repo/semantics/acceptedVersion
Link to the original source: https://link.springer.com/article/10.1007/s40840-015-0268-0
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Article's DOI: 10.1007/s40840-015-0268-0
Entity: Universitat Rovira i Virgili
Journal publication year: 2016
First page: 175
Publication Type: Article Artículo Article
Repositori URV