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

Double domination in rooted product graphs

  • Datos identificativos

    Identificador: imarina:9324073
    Handle: https://hdl.handle.net/20.500.11797/imarina9324073
    Autores:
    Cabrera-Martínez, AEstrada-Moreno, A
    Resumen:
    A set D of vertices of a graph G is a double dominating set of G if |N[v]∩D|≥2 for every v∈V(G), where N[v] represents the closed neighbourhood of v. The double domination number of G is the minimum cardinality among all double dominating sets of G. In this article, we show that if G and H are graphs with no isolated vertex, then for any vertex v∈V(H) there are six possible expressions, in terms of domination parameters of the factor graphs, for the double domination number of the rooted product graph G∘vH. Additionally, we characterize the graphs G and H that satisfy each of these expressions.

  • Otros:

    Autor según el artículo: Cabrera-Martínez, A; Estrada-Moreno, A
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: CABRERA MARTÍNEZ, ABEL / Estrada Moreno, Alejandro
    Palabras clave: Rooted product graph Double domination Domination
    Resumen: A set D of vertices of a graph G is a double dominating set of G if |N[v]∩D|≥2 for every v∈V(G), where N[v] represents the closed neighbourhood of v. The double domination number of G is the minimum cardinality among all double dominating sets of G. In this article, we show that if G and H are graphs with no isolated vertex, then for any vertex v∈V(H) there are six possible expressions, in terms of domination parameters of the factor graphs, for the double domination number of the rooted product graph G∘vH. Additionally, we characterize the graphs G and H that satisfy each of these expressions.
    Á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/
    Direcció de correo del autor: alejandro.estrada@urv.cat
    Identificador del autor: 0000-0001-9767-2177
    Fecha de alta del registro: 2024-08-03
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: https://www.sciencedirect.com/science/article/pii/S0166218X23002391?via%3Dihub
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Discrete Applied Mathematics. 339 127-135
    Referencia de l'ítem segons les normes APA: Cabrera-Martínez, A; Estrada-Moreno, A (2023). Double domination in rooted product graphs. Discrete Applied Mathematics, 339(), 127-135. DOI: 10.1016/j.dam.2023.06.021
    DOI del artículo: 10.1016/j.dam.2023.06.021
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2023
    Tipo de publicación: Journal Publications

  • Palabras clave:

    Applied Mathematics,Discrete Mathematics and Combinatorics,Mathematics, Applied
    Rooted product graph
    Double domination
    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