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 , we present exact values for Roman domination number and total Roman domination number proving that for , . For signed Roman domination number , the new lower and upper bounds for are provided: we prove that for , the lower bound is equal to 2, while the upper bound depends on the parity of and is equal to 3 if is odd, and equal to if 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}
}