Dominating the direct product of two graphs through total Roman strategies

preprint2020arXivOpen access

Abstract

Given a graph GG without isolated vertices, a total Roman dominating function for GG is a function f:V(G)→{0,1,2}f : V(G)\rightarrow \{0,1,2\} such that every vertex with label 0 is adjacent to a vertex with label 2, and the set of vertices with positive labels induces a graph of minimum degree at least one. The total Roman domination number γtR(G)γ_{tR}(G) of GG is the smallest possible value of ∑v∈V(G)f(v)\sum_{v\in V(G)}f(v) among all total Roman dominating functions ff. The total Roman domination number of the direct product G×HG\times H of the graphs GG and HH is studied in this work. Specifically, several relationships, in the shape of upper and lower bounds, between γtR(G×H)γ_{tR}(G\times H) and some classical domination parameters for the factors are given. Characterizations of the direct product graphs G×HG\times H achieving small values (≤7\le 7) for γtR(G×H)γ_{tR}(G\times H) are presented, and exact values for γtR(G×H)γ_{tR}(G\times H) are deduced, while considering various specific direct product classes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.