On the total and strong version for Roman dominating functions in graphs

. The total version of one strong Roman dominating function includes the additional property concerning the not existence of vertices of degree zero in the subgraph of

G

, induced by the set of vertices labeled with a positive value. The minimum possible value for the sum

o m e g a (f) = f (V) = s u m_{v i n V} f (v)

(also called the weight of

f

), taken amongst all existent total strong Roman dominating functions

f

of

G

, is called the total strong Roman domination number of

G

, denoted by

g a m m a_{S t R}^{t} (G)

. This total and strong version of the Roman domination number (for graphs) is introduced in this research, and the study of its mathematical properties is therefore initiated. For instance, we establish upper bounds for such parameter, and relate it with several parameters related to vertex domination in graphs, from which we remark the standard domination number, the total version of the standard domination number and the (strong) Roman domination number. In addition, among other results, we show that for any tree

T

of order

n (T) g e 3

, with maximum degree

D e l t a (T)

and

s (T)

support vertices,

g a m m a_{S t R}^{t} (T) g e l e f t l c e i l f r a c n (T) + s (T) D e l t a (T) i g h t c e i l + 1

.

Review text

As indicated by the authors, many variations on the basic notion of domination in graphs have been introduced in the literature. In particular, one can speak of Roman domination and total domination. In the introduction, the authors say that they will study some combination of these two properties, further noting that the ``total Roman domination number was introduced by \textit{C.-H. Liu} and \textit{G. J. Chang} [J. Comb. Optim. 26, No. 3, 608--619 (2013; Zbl 1282.90217)], although in a more general setting. In fact, the authors add one more adjective to the parameter to be studied. Here, the authors are interested in the ``total strong Roman domination number of a graph. Bounds for general graphs on this new parameter are provided, as well exact results for basic families of graphs such as paths and cycles. The authors also compare the values of the total strong Roman domination number of a graph to other parameters like the domination number, total domination number and strong Roman domination number. Finally, the authors present two bounds for the total strong Roman domination number of trees.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: On the total and strong version for Roman dominating functions in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662879)