Semipaired Domination in Some Subclasses of Chordal Graphs
A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination number, denoted by $\gamma_{pr2}(G)$ is the minimum cardinali...
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2021-07-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Acceso en liña: | https://dmtcs.episciences.org/6782/pdf |