{"title":"Several Roman domination graph invariants on Kneser graphs","authors":"Tatjana Zec, Milana Grbi'c","doi":"10.46298/dmtcs.10506","DOIUrl":null,"url":null,"abstract":"This paper considers the following three Roman domination graph invariants on\nKneser graphs:\n Roman domination, total Roman domination, and signed Roman domination.\n For Kneser graph $K_{n,k}$, we present exact values for Roman domination\nnumber $\\gamma_{R}(K_{n,k})$ and total Roman domination number\n$\\gamma_{tR}(K_{n,k})$ proving that for $n\\geqslant k(k+1)$,\n$\\gamma_{R}(K_{n,k}) =\\gamma_{tR}(K_{n,k}) = 2(k+1)$. For signed Roman\ndomination number $\\gamma_{sR}(K_{n,k})$, the new lower and upper bounds for\n$K_{n,2}$ are provided: we prove that for $n\\geqslant 12$, the lower bound is\nequal to 2, while the upper bound depends on the parity of $n$ and is equal to\n3 if $n$ is odd, and equal to $5$ if $n$ is even. For graphs of smaller\ndimensions, exact values are found by applying exact methods from literature.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics & Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.10506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
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 $K_{n,k}$, we present exact values for Roman domination
number $\gamma_{R}(K_{n,k})$ and total Roman domination number
$\gamma_{tR}(K_{n,k})$ proving that for $n\geqslant k(k+1)$,
$\gamma_{R}(K_{n,k}) =\gamma_{tR}(K_{n,k}) = 2(k+1)$. For signed Roman
domination number $\gamma_{sR}(K_{n,k})$, the new lower and upper bounds for
$K_{n,2}$ are provided: we prove that for $n\geqslant 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.