Secure <i>w</i>-Domination in Graphs
This paper introduces a general approach to the idea of protection of graphs, which encompasses the known variants of secure domination and introduces new ones. Specifically, we introduce the study of secure <i>w</i>-domination in graphs, where <inline-formula><math display=&quo...
Main Authors: | Abel Cabrera Martínez, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-11-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/12/12/1948 |
Similar Items
-
Total Weak Roman Domination in Graphs
by: Abel Cabrera Martínez, et al.
Published: (2019-06-01) -
Secure Total Domination in Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-04-01) -
On the Secure Total Domination Number of Graphs
by: Abel Cabrera Martínez, et al.
Published: (2019-09-01) -
Algorithmic complexity of secure connected domination in graphs
by: J. Pavan Kumar, et al.
Published: (2020-09-01) -
Further Results on the Total Roman Domination in Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-03-01)