Total Roman 2-Reinforcement of Graphs

M. Kheibari, H. Abdollahzadeh Ahangar, R. Khoeilar, S. M. Sheikholeslami and Ahmet Sinan Cevik

Journal of Mathematics, 2021, vol. 2021, 1-7

Abstract: A total Roman 2-dominating function (TR2DF) on a graph Γ=V,E is a function l:V⟶0,1,2, satisfying the conditions that (i) for every vertex y∈V with ly=0, either y is adjacent to a vertex labeled 2 under l, or y is adjacent to at least two vertices labeled 1; (ii) the subgraph induced by the set of vertices with positive weight has no isolated vertex. The weight of a TR2DF l is the value ∑y∈Vly. The total Roman 2-domination number (TR2D-number) of a graph Γ is the minimum weight of a TR2DF on Γ. The total Roman 2-reinforcement number (TR2R-number) of a graph is the minimum number of edges that have to be added to the graph in order to decrease the TR2D-number. In this manuscript, we study the properties of TR2R-number and we present some sharp upper bounds. In particular, we determine the exact value of TR2R-numbers of some classes of graphs.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5515250.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5515250.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:5515250

DOI: 10.1155/2021/5515250

Access Statistics for this article

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