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

Total Weak Roman Domination in Graphs

  • Datos identificativos

    Identificador: imarina:5745867
    Autores:
    Cabrera Martinez, AbelMontejano, Luis PRodriguez-Velazquez, Juan A
    Resumen:
    Given a graph G=(V,E) , a function f:V→{0,1,2,⋯} is said to be a total dominating function if ∑u∈N(v)f(u)>0 for every v∈V , where N(v) denotes the open neighbourhood of v. Let Vi={x∈V:f(x)=i} . We say that a function f:V→{0,1,2} is a total weak Roman dominating function if f is a total dominating function and for every vertex v∈V0 there exists u∈N(v)∩(V1∪V2) such that the function f′ , defined by f′(v)=1 , f′(u)=f(u)−1 and f′(x)=f(x) whenever x∈V\{u,v} , is a total dominating function as well. The weight of a function f is defined to be w(f)=∑v∈Vf(v). In this article, we introduce the study of the total weak Roman domination number of a graph G, denoted by γtr(G) , which is defined to be the minimum weight among all total weak Roman dominating functions on G. We show the close relationship that exists between this novel parameter and other domination parameters of a graph. Furthermore, we obtain general bounds on γtr(G) and, for some particular families of graphs, we obtain closed formulae. Finally, we show that the problem of computing the total weak Roman domination number of a graph is NP-hard.
  • Otros:

    Autor según el artículo: Cabrera Martinez, Abel; Montejano, Luis P; Rodriguez-Velazquez, Juan A
    Departamento: Enginyeria Informàtica i Matemàtiques
    e-ISSN: 2073-8994
    Autor/es de la URV: CABRERA MARTÍNEZ, ABEL / Montejano Cantoral, Luis Pedro / Rodríguez Velázquez, Juan Alberto
    Palabras clave: Weak roman domination Total roman domination Total domination Secure total domination Np-hard problem
    Resumen: Given a graph G=(V,E) , a function f:V→{0,1,2,⋯} is said to be a total dominating function if ∑u∈N(v)f(u)>0 for every v∈V , where N(v) denotes the open neighbourhood of v. Let Vi={x∈V:f(x)=i} . We say that a function f:V→{0,1,2} is a total weak Roman dominating function if f is a total dominating function and for every vertex v∈V0 there exists u∈N(v)∩(V1∪V2) such that the function f′ , defined by f′(v)=1 , f′(u)=f(u)−1 and f′(x)=f(x) whenever x∈V\{u,v} , is a total dominating function as well. The weight of a function f is defined to be w(f)=∑v∈Vf(v). In this article, we introduce the study of the total weak Roman domination number of a graph G, denoted by γtr(G) , which is defined to be the minimum weight among all total weak Roman dominating functions on G. We show the close relationship that exists between this novel parameter and other domination parameters of a graph. Furthermore, we obtain general bounds on γtr(G) and, for some particular families of graphs, we obtain closed formulae. Finally, we show that the problem of computing the total weak Roman domination number of a graph is NP-hard.
    Áreas temáticas: Visual arts and performing arts Physics and astronomy (miscellaneous) Multidisciplinary sciences Modeling and simulation Mathematics, interdisciplinary applications Mathematics (miscellaneous) Mathematics (all) Matemática / probabilidade e estatística General mathematics Engineering (miscellaneous) Computer science (miscellaneous) Ciência da computação Chemistry (miscellaneous) Arts and humanities (miscellaneous) Architecture Applied mathematics
    Acceso a la licencia de uso: thttps://creativecommons.org/licenses/by/3.0/es/
    ISSN: 20738994
    Direcció de correo del autor: luispedro.montejano@urv.cat juanalberto.rodriguez@urv.cat
    Identificador del autor: 0000-0002-9082-7647
    Fecha de alta del registro: 2024-10-26
    Volumen de revista: 11
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: https://www.mdpi.com/2073-8994/11/6/831
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Symmetry-Basel. 11 (6): 831-
    Referencia de l'ítem segons les normes APA: Cabrera Martinez, Abel; Montejano, Luis P; Rodriguez-Velazquez, Juan A (2019). Total Weak Roman Domination in Graphs. Symmetry-Basel, 11(6), 831-. DOI: 10.3390/sym11060831
    DOI del artículo: 10.3390/sym11060831
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2019
    Tipo de publicación: Journal Publications
  • Palabras clave:

    Applied Mathematics,Architecture,Arts and Humanities (Miscellaneous),Chemistry (Miscellaneous),Computer Science (Miscellaneous),Engineering (Miscellaneous),Mathematics (Miscellaneous),Mathematics, Interdisciplinary Applications,Modeling and Simulation,Multidisciplinary Sciences,Physics and Astronomy (Miscellaneous),Visual Arts and Performi
    Weak roman domination
    Total roman domination
    Total domination
    Secure total domination
    Np-hard problem
    Visual arts and performing arts
    Physics and astronomy (miscellaneous)
    Multidisciplinary sciences
    Modeling and simulation
    Mathematics, interdisciplinary applications
    Mathematics (miscellaneous)
    Mathematics (all)
    Matemática / probabilidade e estatística
    General mathematics
    Engineering (miscellaneous)
    Computer science (miscellaneous)
    Ciência da computação
    Chemistry (miscellaneous)
    Arts and humanities (miscellaneous)
    Architecture
    Applied mathematics
  • Documentos:

  • Cerca a google

    Search to google scholar