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

Closed formulae for the strong metric dimension of lexicographic product graphs

  • Datos identificativos

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

  • Otros:

    Autor según el artículo: Kuziak, Dorota; Yero, Ismael G; Rodriguez-Velazquez, Juan A
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: Rodríguez Velázquez, Juan Alberto
    Palabras clave: Strong metric generator Strong metric dimension Strong metric basis Lexicographic product graphs
    Resumen: 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.
    Áreas temáticas: Mathematics Matemática / probabilidade e estatística Discrete mathematics and combinatorics Ciência da computação Applied mathematics
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: juanalberto.rodriguez@urv.cat
    Identificador del autor: 0000-0002-9082-7647
    Fecha de alta del registro: 2024-10-26
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: https://www.dmgt.uz.zgora.pl/publish/volume.php?volume=36_4
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Discussiones Mathematicae Graph Theory. 36 (4): 1051-1064
    Referencia 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 del artículo: 10.7151/dmgt.1911
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2016
    Tipo de publicación: Journal Publications

  • Palabras clave:

    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

  • Documentos:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar