2 problems

Let $G$ be a connected graph of order $n$, and let $\gamma_c(G)$ denote its connected domination number, the minimum size of a connected dominating set of $G$. Connected domination…

Let $G$ be a connected graph on $n$ vertices, let $\Delta(G)$ denote its maximum degree, let $\theta(G)$ denote its clique covering number, and let $\gamma_c^{\infty}(G)$ denote it…