Articles producció científicaEnginyeria Informàtica i Matemàtiques

Closed formulae for the strong metric dimension of lexicographic product graphs

  • Identification data

    Identifier:  PC:1990
    Authors:  Juan A. Rodríguez-Velázquez; Dorota Kuziak; Ismael G. Yero
    Abstract:
    Given a connected graph G, a vertex w ¿ V(G) strongly resolves two vertices u,v ¿ V(G) if there exists some shortest u - w path containing v or some shortest v - w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its factor graphs. © 2016, University of Zielona Gora.
  • Others:

    Link to the original source: https://www.dmgt.uz.zgora.pl/publish/volume.php?volume=36_4
    Article's DOI: 10.7151/dmgt.1911
    Journal publication year: 2016
    Entity: Universitat Rovira i Virgili
    Paper version: info:eu-repo/semantics/publishedVersion
    Record's date: 2016-12-01
    First page: 1051
    URV's Author/s: RODRÍGUEZ VELÁZQUEZ, JUAN ALBERTO; Dorota Kuziak; Ismael G. Yero
    Department: Enginyeria Informàtica i Matemàtiques
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Publication Type: Article
    Last page: 1064
    ISSN: 1234-3099
    Author, as appears in the article.: Juan A. Rodríguez-Velázquez; Dorota Kuziak; Ismael G. Yero
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Journal volume: 36
    Research group: Matemática Discreta
    Thematic Areas: Computer engineering
  • Keywords:

    Strong metric dimension
    Lexicographic product graphs
    Strong metric basis
  • Documents:

  • Cerca a google

    Search to google scholar