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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2021-08-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol8/iss2/5 |