Some results on the independence number of connected domination critical graphs

A k-γc-critical graph is a graph G with connected domination number γc(G)=k and γc(G+uv)