**Author, as appears in the article.: **Almerich-Chulia, Ana; Cabrera Martinez, Abel; Hernandez Mira, Frank Angel; Martin-Concepcion, Pedro;

**Department: **Enginyeria Informàtica i Matemàtiques

**e-ISSN: **2073-8994

**URV's Author/s: **CABRERA MARTÍNEZ, ABEL

**Keywords: ** Total roman domination Total domination Strongly total roman domination Number Lexicographic product graph

**Abstract: **Let G be a graph with no isolated vertex and let N (v) be the open neighbourhood of v is an element of V (G). Let f : V (G) -> {0, 1, 2} be a function and V-i = {v is an element of V (G) : f (v) = i} for every i is an element of{0, 1, 2}. We say that f is a strongly total Roman dominating function on G if the subgraph induced by V-1 boolean OR V-2 has no isolated vertex and N (v) boolean AND V-2 not equal empty set for every v is an element of V (G) \ V2. The strongly total Roman domination number of G, denoted by gamma(s)(tR) (G), is defined as the minimum weight omega(f) = Sigma(x is an element of V(G)) f (x) among all strongly total Roman dominating functions f on G. This paper is devoted to the study of the strongly total 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 show that the theory of strongly total Roman domination is an appropriate framework for investigating the total Roman domination number of lexicographic product graphs. We also obtain tight bounds on this parameter and provide closed formulas for some product graphs. Finally and as a consequence of the study, we prove that the problem of computing gamma(s)(tR) (G) is NP-hard.

**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-10

**Journal volume: **13

**Papper version: **info:eu-repo/semantics/publishedVersion

**Link to the original source: **https://www.mdpi.com/2073-8994/13/7/1282

**Licence document URL: **http://repositori.urv.cat/ca/proteccio-de-dades/

**Papper original source: **Symmetry-Basel. 13 (7):

**APA: **Almerich-Chulia, Ana; Cabrera Martinez, Abel; Hernandez Mira, Frank Angel; Martin-Concepcion, Pedro; (2021). From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs. Symmetry-Basel, 13(7), -. DOI: 10.3390/sym13071282

**Article's DOI: **10.3390/sym13071282

**Entity: **Universitat Rovira i Virgili

**Journal publication year: **2021

**Publication Type: **Journal Publications