Bounds on the global double Roman domination number in graphs
Bounds on the global double Roman domination number in graphs
复制标题
图表中全球双罗马统治数的界限
DOI：
10.7151/dmgt.2460
复制
发表时间：
--
影响因子：
0.7
通讯作者：
Xiaodan Chen
中科院分区：
文献类型：
--
作者：
Guoliang Hao;Shouliu Wei;Seyed Mahmoud Sheikholeslami;Xiaodan Chen
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).
