Articles producció científica> Enginyeria Informàtica i Matemàtiques

Closed formulae for the strong metric dimension of lexicographic product graphs

  • Dades identificatives

    Identificador: imarina:5130478
    Handle: https://hdl.handle.net/20.500.11797/imarina5130478
    Autors:
    Kuziak, DorotaYero, Ismael GRodriguez-Velazquez, Juan A
    Resum:
    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.

  • Altres:

    Autor segons l'article: Kuziak, Dorota; Yero, Ismael G; Rodriguez-Velazquez, Juan A
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Rodríguez Velázquez, Juan Alberto
    Paraules clau: Strong metric generator Strong metric dimension Strong metric basis Lexicographic product graphs
    Resum: 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.
    Àrees temàtiques: Mathematics Matemática / probabilidade e estatística Discrete mathematics and combinatorics Ciência da computação Applied mathematics
    Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
    Adreça de correu electrònic de l'autor: juanalberto.rodriguez@urv.cat
    Identificador de l'autor: 0000-0002-9082-7647
    Data d'alta del registre: 2024-10-26
    Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
    Enllaç font original: https://www.dmgt.uz.zgora.pl/publish/volume.php?volume=36_4
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Discussiones Mathematicae Graph Theory. 36 (4): 1051-1064
    Referència de l'ítem segons les normes APA: Kuziak, Dorota; Yero, Ismael G; Rodriguez-Velazquez, Juan A (2016). Closed formulae for the strong metric dimension of lexicographic product graphs. Discussiones Mathematicae Graph Theory, 36(4), 1051-1064. DOI: 10.7151/dmgt.1911
    DOI de l'article: 10.7151/dmgt.1911
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2016
    Tipus de publicació: Journal Publications

  • Paraules clau:

    Applied Mathematics,Discrete Mathematics and Combinatorics,Mathematics
    Strong metric generator
    Strong metric dimension
    Strong metric basis
    Lexicographic product graphs
    Mathematics
    Matemática / probabilidade e estatística
    Discrete mathematics and combinatorics
    Ciência da computação
    Applied mathematics

  • Documents:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar