Some modified types of pitchfork domination and it's inverse
Let G be a finite, simple graph, without isolated vertices. For any non-negative integers x and y, a set D ⊆ V is a ”pitchfork dominating set pds”, when every vertex in D, dominates at most y and at least x vertices of V − D. A subset D−1 of V − D is an inverse pds if it is a pitchfork set. The pit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática
2022-02-01
|
| Series: | Boletim da Sociedade Paranaense de Matemática |
| Online Access: | https://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/51201 |