Several Roman domination graph invariants on Kneser graphs
Tatjana Zec, Milana Grbi\'c

TL;DR
This paper investigates Roman domination invariants on Kneser graphs, providing exact values and bounds for different types of Roman domination numbers, with new results especially for the case of signed Roman domination.
Contribution
It offers exact formulas for Roman and total Roman domination numbers on Kneser graphs and establishes new bounds for signed Roman domination numbers, expanding understanding of these invariants.
Findings
Exact values for $\gamma_{R}$ and $\gamma_{tR}$ when $n \\geq k(k+1)$.
New bounds for $\gamma_{sR}$ on $K_{n,2}$ depending on $n$'s parity.
Exact values for smaller graphs using existing methods.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
