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

Strong resolving graphs: the realization and the characterization problems

  • Dades identificatives

    Identificador: imarina:5133135
    Autors:
    Kuziak, DorotaLuz Puertas, MariaRodriguez-Velazquez, Juan A.Yero, Ismael G.
    Resum:
    The strong resolving graph of a connected graph was introduced in Oellermann and Peters-Fransen (2007) as a tool to study the strong metric dimension of . Basically, it was shown that the problem of finding the strong metric dimension of can be transformed to the problem of finding the vertex cover number of . Since then, several articles on the strong metric dimension of graphs which are using this tool have been published. However, the tool itself has remained unnoticed as a properly structure. In this paper, we survey the state of knowledge on the strong resolving graphs, and also derive some new results regarding its properties.
  • Altres:

    Autor segons l'article: Kuziak, Dorota; Luz Puertas, Maria; Rodriguez-Velazquez, Juan A.; Yero, Ismael G.;
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Rodríguez Velázquez, Juan Alberto
    Paraules clau: Strong resolving graph Strong metric dimension Graphs transformations
    Resum: The strong resolving graph of a connected graph was introduced in Oellermann and Peters-Fransen (2007) as a tool to study the strong metric dimension of . Basically, it was shown that the problem of finding the strong metric dimension of can be transformed to the problem of finding the vertex cover number of . Since then, several articles on the strong metric dimension of graphs which are using this tool have been published. However, the tool itself has remained unnoticed as a properly structure. In this paper, we survey the state of knowledge on the strong resolving graphs, and also derive some new results regarding its properties.
    Àrees temàtiques: Mathematics, applied Matemática / probabilidade e estatística Linguística e literatura Interdisciplinar Ensino Engenharias iv Engenharias iii Engenharias i Discrete mathematics and combinatorics Ciências biológicas i 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-09-07
    Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
    Enllaç font original: https://www.sciencedirect.com/science/article/pii/S0166218X17305346?via%3Dihub
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Discrete Applied Mathematics. 236 (C): 270-287
    Referència de l'ítem segons les normes APA: Kuziak, Dorota; Luz Puertas, Maria; Rodriguez-Velazquez, Juan A.; Yero, Ismael G.; (2018). Strong resolving graphs: the realization and the characterization problems. Discrete Applied Mathematics, 236(C), 270-287. DOI: 10.1016/j.dam.2017.11.013
    DOI de l'article: 10.1016/j.dam.2017.11.013
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2018
    Tipus de publicació: Journal Publications
  • Paraules clau:

    Applied Mathematics,Discrete Mathematics and Combinatorics,Mathematics, Applied
    Strong resolving graph
    Strong metric dimension
    Graphs transformations
    Mathematics, applied
    Matemática / probabilidade e estatística
    Linguística e literatura
    Interdisciplinar
    Ensino
    Engenharias iv
    Engenharias iii
    Engenharias i
    Discrete mathematics and combinatorics
    Ciências biológicas i
    Ciência da computação
    Applied mathematics
  • Documents:

  • Cerca a google

    Search to google scholar