Applying the (1,2)-pitchfork domination and it's inverse on some special graphs
Let G be a finite simple and undirected graph without isolated vertices. For any non-negative integers j and k, a subset D of V is called a pitchfork dominating set if every vertex in D dominates at least j and at most k vertices of V - D. A subset D -1 of V - D is an inverse pitchfork dominating...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática
2022-12-01
|
| Series: | Boletim da Sociedade Paranaense de Matemática |
| Online Access: | https://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/52252 |