The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs -- Convex Polytopes

Abstract

In this paper we deal with the calculation of the signed (total) Roman domination numbers, γsR and γstR respectively, on a few classes of planar graphs from the literature. We give proofs for the exact values of the numbers γsR(An) and γsR(Rn) as well as the numbers γstR(Sn) and γstR(Tn). For some other classes of planar graphs, such as Qn, %Sn" and Tn", lower and upper bounds on γsR are calculated and proved. %We give some open problems on the exact values of γsR and γstR for some classes of planar graphs.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…