Some complexity results on semipaired domination in graphs
Let [Formula: see text] be a graph without any isolated vertices. A semipaired dominating set [Formula: see text] of G, is a dominating set of G, if D can be partitioned into cardinality 2 subsets such that the vertices in each of these subsets are at distance at most two from each other. The Min-Se...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Taylor & Francis Group
2025-05-01
|
| Col·lecció: | AKCE International Journal of Graphs and Combinatorics |
| Matèries: | |
| Accés en línia: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2443910 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|