JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2025, Vol. 60 ›› Issue (8): 52-56.doi: 10.6040/j.issn.1671-9352.0.2023.301

Previous Articles    

The relationship between global Roman domination number and Roman domination number of graphs

HAO Guoliang1,2, WU Yuqi2,3, JIANG Haining1   

  1. 1. School of Mathematics and Statistics, Heze University, Heze 274015, Shandong, China;
    2. College of Science, East China University of Technology, Nanchang 330013, Jiangxi, China;
    3. School of Computer Information Engineering, Nanchang Institute of Technology, Nanchang 330044, Jiangxi, China
  • Published:2025-07-25

PDF (PC)

13

Abstract: The new inequality relationships between global Roman domination number and Roman domination number are obtained by using the graph parameters such as the order, the number of edges and degree.

Key words: Roman domination, global Roman domination, domination number

CLC Number: 

  • O157.5
[1] ABD AZIZ N A, RAD NADER J, KAMARULHAILI H. A note on the double domination number in maximal outerplanar and planar graphs[J]. Rairo-Operations Research, 2022, 56(5):3367-3371.
[2] HUA Xinying, XU Kexiang, HUA Hongbo. Relating the annihilation number and the total domination number for some graphs[J]. Discrete Applied Mathematics, 2023, 332:41-46.
[3] HENNING M A, KLOSTERMEYER W F. Italian domination in trees[J]. Discrete Applied Mathematics, 2017, 217:557-564.
[4] 郝国亮,曾淑婷. 全局3-彩虹控制数等于顶点数的图的刻画[J]. 应用数学学报,2024,47(3):417-428. HAO Guoliang, ZENG Shuting. A characterization of graphs with global 3-rainbow domination number equal to the number of vertices[J]. Acta Mathematicae Applicatae Sinica, 2024, 47(3):417-428.
[5] HENNING M A, PILSNIAK M, TUMIDAJEWICZ E. Bounds on the paired domination number of graphs with minimum degree at least three[J]. Applied Mathematics and Computation, 2022, 417:126782.
[6] COCKAYNE E J, DREYER P A, HEDETNIEMI S M, et al. Roman domination in graphs[J]. Discrete Mathematics, 2004, 278:11-22.
[7] MARTINEZ A C, GARCIA-GOMEZ C, RODRIGUEZ-VELAZQUEZ J A. Perfect domination, Roman domination and perfect Roman domination in lexicographic product graphs[J]. Fundamenta Informaticae, 2022, 185(3):201-220.
[8] CHIN A Y M, MAIMANI H R, POURNAKI M R, et al. Unitary Cayley graphs whose Roman domination numbers are at most four[J]. Akce International Journal of Graphs and Combinatorics, 2022, 19(1):36-40.
[9] ATAPOUR M, SHEIKHOLESLAMI S M, VOLKMANN L. Global Roman domination in trees[J]. Graphs and Combinatorics, 2015, 31(4):813-825.
[10] AHANGAR H A. On the global Roman domination number in graphs[J]. Iranian Journal of Science and Technology Transactions A-Science, 2016, 40(3):157-163.
[11] PUSHPAM P R L, PADMAPRIEA S. Global Roman domination in graphs[J]. Discrete Applied Mathematics, 2016, 200:176-185.
[12] CHELLALI M, HAYNES T W, HEDETNIEMI S T, et al. Roman {2}-domination[J]. Discrete Applied Mathematics, 2016, 204:22-28.
[13] AHANGAR H A, HENNING M A, SAMODIVKIN V, et al. Total Roman domination in graphs[J]. Applicable Analysis and Discrete Mathematics, 2016, 10(2):501-507.
[1] XIE Zhi-hong, HAO Guo-liang. Bounds on the double Roman domination number of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(11): 21-25.
[2] ZHU Xiao-ying, PANG Shi-you. On the maximal eccentric distance sum of tree with given domination number [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(2): 30-36.
[3] GAO Chao, HOU Xin-min*. Some remarks on maximum size of bipartite graphs with a given domination number [J]. J4, 2013, 48(8): 21-23.
[4] CHEN Hong-yu1,2, ZHANG Li3. Maximum number of edges in connected bipartite graphs with  a given domination number [J]. J4, 2012, 47(8): 11-15.
[5] YUAN Xiu-hua. The total signed domination number of complete graph [J]. J4, 2010, 45(8): 43-46.
[6] XU Lan1,2, XU Ying 1, ZHANG Li 3. Independent domination bicritical graphs [J]. J4, 2010, 45(10): 40-44.
[7] WANG Bing . Properties of a quasi-claw-free graph [J]. J4, 2007, 42(10): 111-113 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd