  A graph $G$ is said to be $k$-$\gamma_{c}$-critical if the connected
domination number $\gamma_{c}(G)$ is equal to $k$ and $\gamma_{c}(G + uv) < k$
for any pair of non-adjacent vertices $u$ and $v$ of $G$. Let $\zeta$ be the
number of cut vertices of $G$ and let $\zeta_{0}$ be the maximum number of cut
vertices that can be contained in one block. For an integer $\ell \geq 0$, a
graph $G$ is $\ell$-factor critical if $G - S$ has a perfect matching for any
subset $S$ of vertices of size $\ell$. It was proved that, for $k \geq 3$,
every $k$-$\gamma_{c}$-critical graph has at most $k - 2$ cut vertices and the
graphs with maximum number of cut vertices were characterized. It was proved
further that, for $k \geq 4$, every $k$-$\gamma_{c}$-critical graphs satisfies
the inequality $\zeta_{0}(G) \le \min \left\{ \left\lfloor \frac{k + 2}{3}
\right\rfloor, \zeta \right\}$. In this paper, we characterize all
$k$-$\gamma_{c}$-critical graphs having $k - 3$ cut vertices. Further, we
establish realizability that, for given $k \geq 4$, $2 \leq \zeta \leq k - 2$
and $2 \leq \zeta_{0} \le \min \left\{ \left\lfloor \frac{k + 2}{3}
\right\rfloor, \zeta \right\}$, there exists a $k$-$\gamma_{c}$-critical graph
with $\zeta$ cut vertices having a block which contains $\zeta_{0}$ cut
vertices. Finally, we proved that every $k$-$\gamma_{c}$-critical graph of odd
order with minimum degree two is $1$-factor critical if and only if $1 \leq k
\leq 2$. Further, we proved that every $k$-$\gamma_{c}$-critical $K_{1,
3}$-free graph of even order with minimum degree three is $2$-factor critical
if and only if $1 \leq k \leq 2$.
