1 |
Connected Domination Stable Graphs Upon Edge AdditionDesormeaux, Wyatt J., Haynes, Teresa W., van der Merwe, Lucas 04 December 2015 (has links)
A 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.
|
Page generated in 0.1358 seconds