New Bounds on the Triple Roman Domination Number of Graphs

M. Hajjari, H. Abdollahzadeh Ahangar, R. Khoeilar, Z. Shao, S. M. Sheikholeslami and Firdous A. Shah

Journal of Mathematics, 2022, vol. 2022, 1-5

Abstract: In this paper, we derive sharp upper and lower bounds on the sum γ3RG+γ3RG¯ and product γ3RGγ3RG¯, where G¯ is the complement of graph G. We also show that for each tree T of order n≥2, γ3RT≤3n+sT/2 and γ3RT≥⌈4nT+2−ℓT/3⌉, where sT and ℓT are the number of support vertices and leaves of T.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/9992618.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/9992618.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:9992618

DOI: 10.1155/2022/9992618

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().