Independence and Connectivity of Connected Domination Critical Graphs

Pawaton Kaemawichanurat, Louis Caccetta

A graph $G$ is said to be $k$-${\gamma }_c$-critical if the connected domination number ${\gamma }_c(G)=k$ and ${\gamma }_c(G+uv)<k$ for every $uv\in E(\overline{G})$. Let $\delta ,\kappa$ and $\alpha$ be r…