Bounds on the Global Double Roman Domination Number in Graphs

IF 0.5 4区 数学 Q3 MATHEMATICS
Guoliang Hao, Shouliu Wei, S. M. Sheikholeslami, Xiaodan Chen
{"title":"Bounds on the Global Double Roman Domination Number in Graphs","authors":"Guoliang Hao, Shouliu Wei, S. M. Sheikholeslami, Xiaodan Chen","doi":"10.7151/dmgt.2460","DOIUrl":null,"url":null,"abstract":"Abstract Let G be a simple graph of order n and let γgdR(G) be the global double Roman domination number of G. In this paper, we give some upper bounds on the global double Roman domination number of G. In particular, we completely characterize the graph G with γgdR(G) = 2n − 2 and γgdR(G) = 2n − 3. Our results answer a question posed by Shao et al. (2019).","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2460","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Let G be a simple graph of order n and let γgdR(G) be the global double Roman domination number of G. In this paper, we give some upper bounds on the global double Roman domination number of G. In particular, we completely characterize the graph G with γgdR(G) = 2n − 2 and γgdR(G) = 2n − 3. Our results answer a question posed by Shao et al. (2019).
图中全局双罗马统治数的界
摘要设G为n阶的简单图,设γgdR(G)为G的全局双罗马控制数。本文给出了G的全局双罗马控制数的一些上界,特别是完整地刻画了γgdR(G) = 2n−2和γgdR(G) = 2n−3的图G。我们的研究结果回答了Shao等人(2019)提出的一个问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
22
审稿时长
53 weeks
期刊介绍: The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信