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, and respectively, on a few classes of planar graphs from the literature. We give proofs for the exact values of the numbers and as well as the numbers and . For some other classes of planar graphs, such as , % and , lower and upper bounds on are calculated and proved. %We give some open problems on the exact values of and 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}
}