Connected Domination Stable Graphs Upon Edge Addition |
| |
Abstract: | AbstractA set S of vertices in a graph G is a connected dominating set of G if S dominates G and the subgraph induced by S is connected. We study the graphs for which adding any edge does not change the connected domination number. |
| |
Keywords: | 05C69 |
|
|