English

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

Combinatorics 2021-07-20 v1

Abstract

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

Keywords

Cite

@article{arxiv.2107.08263,
  title  = {The Signed (Total) Roman Domination Problem on some Classes of Planar Graphs -- Convex Polytopes},
  author = {Tatjana Zec and Marko Djukanovic and Dragan Matic},
  journal= {arXiv preprint arXiv:2107.08263},
  year   = {2021}
}