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

Double domination in lexicographic product graphs

  • Datos identificativos

    Identificador: imarina:6232285
    Handle: https://hdl.handle.net/20.500.11797/imarina6232285
    Autores:
    Cabrera Martínez ACabrera García SRodríguez-Velázquez JA
    Resumen:
    © 2020 Elsevier B.V. In a graph G, a vertex dominates itself and its neighbours. A subset S⊆V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G∘H in terms of invariants of the factor graphs G and H.

  • Otros:

    Autor según el artículo: Cabrera Martínez A; Cabrera García S; Rodríguez-Velázquez JA
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: CABRERA MARTÍNEZ, ABEL / Rodríguez Velázquez, Juan Alberto
    Palabras clave: Total roman {2}-domination Total roman domination Total domination Number Lexicographic product Double domination
    Resumen: © 2020 Elsevier B.V. In a graph G, a vertex dominates itself and its neighbours. A subset S⊆V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G∘H in terms of invariants of the factor graphs G and H.
    Áreas temáticas: 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
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    ISSN: 0166-218X
    Direcció de correo del autor: juanalberto.rodriguez@urv.cat
    Identificador del autor: 0000-0002-9082-7647
    Fecha de alta del registro: 2023-02-19
    Versión del articulo depositado: info:eu-repo/semantics/acceptedVersion
    Enlace a la fuente original: https://www.sciencedirect.com/science/article/abs/pii/S0166218X2030144X?via%3Dihub
    Referencia al articulo segun fuente origial: Discrete Applied Mathematics. 284 290-300
    Referencia de l'ítem segons les normes APA: Cabrera Martínez A; Cabrera García S; Rodríguez-Velázquez JA (2020). Double domination in lexicographic product graphs. Discrete Applied Mathematics, 284(), 290-300. DOI: 10.1016/j.dam.2020.03.045
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    DOI del artículo: 10.1016/j.dam.2020.03.045
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2020
    Tipo de publicación: Journal Publications

  • Palabras clave:

    Applied Mathematics,Discrete Mathematics and Combinatorics,Mathematics, Applied
    Total roman {2}-domination
    Total roman domination
    Total domination
    Number
    Lexicographic product
    Double domination
    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

  • Documentos:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar