Reinforcement Number of a Graph with respect to Half-Domination
In this paper, we introduce the concept of reinforcement number with respect to half-domination and initiate a study on this parameter. Furthermore, we obtain various upper bounds for this parameter. AMS subject classification: 05C38, 05C40, 05C69.
Saved in:
Main Authors: | G. Muhiuddin, N. Sridharan, D. Al-Kadi, S. Amutha, M. E. Elnair |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6689816 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Co-Secure Domination Number in Some Graphs
by: Jiatong Cui, et al.
Published: (2024-12-01) -
New Bounds on the Triple Roman Domination Number of Graphs
by: M. Hajjari, et al.
Published: (2022-01-01) -
Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs
by: Fu-Tao Hu, et al.
Published: (2024-01-01) -
On Vertex Covering Transversal Domination Number of Regular Graphs
by: R. Vasanthi, et al.
Published: (2016-01-01) -
Shields-Harary numbers of graphs with respect to continuous concave cost functions
by: John Holliday, et al.
Published: (2003-01-01)