RT journal article
T1 Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs
A1 Cabrera Martínez, Abel
A1 Kuziak, Dorota
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 Outer-independent total Roman domination
K1 vertex cover
K1 domination
K1 (total)Roman domination
K1 independence
AB For a given graph G without isolated vertex we consider a function f : V (G) -> {0,1, 2}. For every i is an element of {0,1, 2}, let V-i = {v is an element of V (G) : f (v) = i}. The function f is known to be an outer-independent total Roman dominating function for the graph G if it is satisfied that; (i) every vertex in V-0 is adjacent to at least one vertex in V-2; (ii) V-0 is an independent set; and (iii) the subgraph induced by V-1 boolean OR V-2 has no isolated vertex. The minimum possible weight omega(f) = Sigma(v is an element of V(G)) f(v) among all outer-independent total Roman dominating functions for G is called the outer-independent total Roman domination number of G. In this article we obtain new tight bounds for this parameter that improve some well-known results. Such bounds can also be seen as relationships between this parameter and several other classical parameters in graph theory like the domination, total domination, Roman domination, independence, and vertex cover numbers. In addition, we compute the outer-independent total Roman domination number of Sierpinski graphs, circulant graphs, and the Cartesian and direct products of complete graphs.
PB SPRINGER BASEL
SN 1660-5446
YR 2022
FD 2022-06
LK http://hdl.handle.net/10498/27026
UL http://hdl.handle.net/10498/27026
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026