-tuple domination on Kneser graphs

MG Cornet, P Torres - arXiv preprint arXiv:2308.15603, 2023 - arxiv.org
In this paper, we continue the study of different types of dominating sets in Kneser graphs.
We focus on $ k $-tuple dominating sets, $2 $-packings and the associated graph …

Total Perfect Roman Domination

A Almulhim - Symmetry, 2023 - mdpi.com
A total perfect Roman dominating function (TPRDF) on a graph G=(V, E) is a function f from
V to {0, 1, 2} satisfying (i) every vertex v with f (v)= 0 is a neighbor of exactly one vertex u with …

On double Roman domination problem for several graph classes

T Zec, D Matić, M Djukanović - Aequationes mathematicae, 2024 - Springer
A double Roman domination function (DRDF) on a graph\(G=(V, E)\) is a mapping\(f:
V\rightarrow\{0, 1, 2, 3\}\) satisfying the conditions:(i) each vertex with 0 assigned is adjacent …

-Domination invariants on Kneser graphs

B Brešar, MG Cornet, T Dravec, MA Henning - arXiv preprint arXiv …, 2023 - arxiv.org
In this follow-up to [MG~ Cornet, P.~ Torres, arXiv: 2308.15603], where the $ k $-tuple
domination number and the 2-packing number in Kneser graphs $ K (n, r) $ were studied …

Approximation Algorithm for Connected Roman -Dominating Set

M He, R Klasing, Y Mao, X Zhang - Available at SSRN 5060725 - papers.ssrn.com
A Roman $ k $-dominating function (Rk-DF) on $ G $ is a function $ f_ {kR}: V
(G)\rightarrow\{0, 1, 2\} $ such that every vertex $ u $ with $ f_ {kR}(u)= 0$ is adjacent to at …