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

On the Outer-Independent Roman Domination in Graphs

  • Identification data

    Identifier: imarina:9093694
    Authors:
    Martinez, Abel CabreraGarcia, Suitberto CabreraCarrion Garcia, AndresGrisales del Rio, Angela Maria
    Abstract:
    Let G be a graph with no isolated vertex and f:V(G)->{0,1,2} a function. Let V-i={v is an element of V(G):f(v)=i} for every i is an element of{0,1,2}. The function f is an outer-independent Roman dominating function on G if V0 is an independent set and every vertex in V-0 is adjacent to at least one vertex in V-2. The minimum weight omega(f)= Sigma v is an element of V(G)f(v) among all outer-independent Roman dominating functions f on G is the outer-independent Roman domination number of G. This paper is devoted to the study of the outer-independent Roman domination number of a graph, and it is a contribution to the special issue Theoretical Computer Science and Discrete Mathematics of Symmetry. In particular, we obtain new tight bounds for this parameter, and some of them improve some well-known results. We also provide closed formulas for the outer-independent Roman domination number of rooted product graphs.
  • Others:

    Author, as appears in the article.: Martinez, Abel Cabrera; Garcia, Suitberto Cabrera; Carrion Garcia, Andres; Grisales del Rio, Angela Maria;
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: CABRERA MARTÍNEZ, ABEL
    Keywords: Vertex cover Rooted product graph Roman domination Outer-independent roman domination
    Abstract: Let G be a graph with no isolated vertex and f:V(G)->{0,1,2} a function. Let V-i={v is an element of V(G):f(v)=i} for every i is an element of{0,1,2}. The function f is an outer-independent Roman dominating function on G if V0 is an independent set and every vertex in V-0 is adjacent to at least one vertex in V-2. The minimum weight omega(f)= Sigma v is an element of V(G)f(v) among all outer-independent Roman dominating functions f on G is the outer-independent Roman domination number of G. This paper is devoted to the study of the outer-independent Roman domination number of a graph, and it is a contribution to the special issue Theoretical Computer Science and Discrete Mathematics of Symmetry. In particular, we obtain new tight bounds for this parameter, and some of them improve some well-known results. We also provide closed formulas for the outer-independent Roman domination number of rooted product graphs.
    Thematic Areas: Physics and astronomy (miscellaneous) Multidisciplinary sciences Mathematics, interdisciplinary applications Mathematics (miscellaneous) Matemática / probabilidade e estatística General mathematics Computer science (miscellaneous) Ciência da computação Chemistry (miscellaneous)
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Author's mail: abel.cabrera@urv.cat
    Author identifier: 0000-0003-2806-4842
    Record's date: 2021-10-31
    Papper version: info:eu-repo/semantics/publishedVersion
    Papper original source: Symmetry-Basel. 12 (11):
    APA: Martinez, Abel Cabrera; Garcia, Suitberto Cabrera; Carrion Garcia, Andres; Grisales del Rio, Angela Maria; (2020). On the Outer-Independent Roman Domination in Graphs. Symmetry-Basel, 12(11), -. DOI: 10.3390/sym12111846
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2020
    Publication Type: Journal Publications
  • Keywords:

    Chemistry (Miscellaneous),Computer Science (Miscellaneous),Mathematics (Miscellaneous),Mathematics, Interdisciplinary Applications,Multidisciplinary Sciences,Physics and Astronomy (Miscellaneous)
    Vertex cover
    Rooted product graph
    Roman domination
    Outer-independent roman domination
    Physics and astronomy (miscellaneous)
    Multidisciplinary sciences
    Mathematics, interdisciplinary applications
    Mathematics (miscellaneous)
    Matemática / probabilidade e estatística
    General mathematics
    Computer science (miscellaneous)
    Ciência da computação
    Chemistry (miscellaneous)
  • Documents:

  • Cerca a google

    Search to google scholar