Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs

Abstract

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.