Several Roman domination graph invariants on Kneser graphs

Tatjana Zec, Milana Grbi'c
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Kneser图上的几个罗马统治图不变量
本文考虑了kneser图上的三个罗马统治图不变量:罗马统治、完全罗马统治和签名罗马统治。对于Kneser图$K_{n,k}$,我们给出了罗马统治数$\gamma_{R}(K_{n,k})$和总罗马统治数$\gamma_{tR}(K_{n,k})$的精确值,证明了对于$n\geqslant k(k+1)$, $\gamma_{R}(K_{n,k}) =\gamma_{tR}(K_{n,k}) = 2(k+1)$。对于带符号的罗马支配数$\gamma_{sR}(K_{n,k})$,给出了$K_{n,2}$的新的下界和上界:我们证明了对于$n\geqslant 12$,下界等于2,而上界取决于$n$的奇偶性,如果$n$是奇数,上界等于3,如果$n$是偶数,上界等于$5$。对于较小维度的图,通过应用文献中的精确方法来找到精确值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Leanness Computation: Small Values and Special Graph Classes On the protected nodes in exponential recursive trees Inversion sequences avoiding 021 and another pattern of length four From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows Maker-Breaker domination game on trees when Staller wins
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1