Several Roman domination graph invariants on Kneser graphs

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,k, we present exact values for Roman domination number γR(Kn,k) and total Roman domination number γtR(Kn,k) proving that for n≥slant k(k+1), γR(Kn,k) =γtR(Kn,k) = 2(k+1). For signed Roman domination number γsR(Kn,k), the new lower and upper bounds for Kn,2 are provided: we prove that for n≥slant 12, the lower bound is equal to 2, while the upper bound depends on the parity of n and is equal to 3 if n is odd, and equal to 5 if n is even. For graphs of smaller dimensions, exact values are found by applying exact methods from literature.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…