Some Classes of 3-Gamma c-Critical Graph
Zhen Yu, Hongmei Liu · 2008
Dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The minimum number of vertices in a connected dominating set of G is called the connected domination number of G, and is denoted by gammac(G). The purpose of this paper is to initiate an investigation of those graphs which are critical in the following sense: for each v, u epsiv V(G) with v not adjacent to u, gammac(G + vu)c(G). Thus, G is k- gammac- critical if gammac(G) = k and for each edge e not in E(G),gammac(G)c- critical graph.