Upper bounds for inverse domination in graphs
In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The \emph{Inverse Domination Conjecture} says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with $|D|=\gamma(G)$ and $|D'| \leq \alpha(G)$. Here...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Georgia Southern University
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/a781f4f3bd8947448ccf77849beb240d |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sea el primero en dejar un comentario!