Connected domination critical graphs with respect to relative complements
A dominating set in a graph is a connected dominating set of if it induces a connected subgraph of . The minimum number of vertices in a connected dominating set of is called the connected domination number of , and is denoted by . Let be a spanning subgraph of and let be the complement of relative to ; that is, is a factorization of . The graph is --critical relative to if and for each edge . First, we discuss some classes of graphs whether they are -critical relative...