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$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。