English

Several Roman domination graph invariants on Kneser graphs

Combinatorics 2024-02-14 v3

Abstract

This paper considers the following three Roman domination graph invariants on Kneser graphs: Roman domination, total Roman domination, and signed Roman domination. For Kneser graph Kn,kK_{n,k}, we present exact values for Roman domination number γR(Kn,k)\gamma_{R}(K_{n,k}) and total Roman domination number γtR(Kn,k)\gamma_{tR}(K_{n,k}) proving that for nk(k+1)n\geqslant k(k+1), γR(Kn,k)=γtR(Kn,k)=2(k+1)\gamma_{R}(K_{n,k}) =\gamma_{tR}(K_{n,k}) = 2(k+1). For signed Roman domination number γsR(Kn,k)\gamma_{sR}(K_{n,k}), the new lower and upper bounds for Kn,2K_{n,2} are provided: we prove that for n12n\geqslant 12, the lower bound is equal to 2, while the upper bound depends on the parity of nn and is equal to 3 if nn is odd, and equal to 55 if nn is even. For graphs of smaller dimensions, exact values are found by applying exact methods from literature.

Keywords

Cite

@article{arxiv.2204.05664,
  title  = {Several Roman domination graph invariants on Kneser graphs},
  author = {Tatjana Zec and Milana Grbić},
  journal= {arXiv preprint arXiv:2204.05664},
  year   = {2024}
}
R2 v1 2026-06-24T10:45:35.932Z