Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2506.03646 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911446974070784 |
|---|---|
| author | Annor, Dickson Y. B. |
| author_facet | Annor, Dickson Y. B. |
| contents | In this short paper, we establish relations between the domination number $γ$, the total domination number $γ_t$, and the connected domination number $γ_c$ of a graph. In particular, we prove upper and lower bounds for $γ_t$ in terms of $γ$ and $γ_c$. Moreover, we propose the following conjecture: for every connected isolated-free graph $G$, \begin{equation*}\label{eq:low}
γ_t(G) \geq \left \lfloor \frac{3γ(G) +2γ_c(G)}{6}\right\rfloor. \end{equation*} As evidence to support the conjecture, we prove that the conjecture holds when $γ_t(G) = γ_c(G)$ and also, when $γ_t(G) = γ_c(G) -1$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03646 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Note on Inequalities for Three Domination Parameters Annor, Dickson Y. B. Combinatorics In this short paper, we establish relations between the domination number $γ$, the total domination number $γ_t$, and the connected domination number $γ_c$ of a graph. In particular, we prove upper and lower bounds for $γ_t$ in terms of $γ$ and $γ_c$. Moreover, we propose the following conjecture: for every connected isolated-free graph $G$, \begin{equation*}\label{eq:low} γ_t(G) \geq \left \lfloor \frac{3γ(G) +2γ_c(G)}{6}\right\rfloor. \end{equation*} As evidence to support the conjecture, we prove that the conjecture holds when $γ_t(G) = γ_c(G)$ and also, when $γ_t(G) = γ_c(G) -1$. |
| title | A Note on Inequalities for Three Domination Parameters |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.03646 |