Connected Domination Stable Graphs Upon Edge Addition

Creator(s)

Wyatt J. Desormeaux, University of Johannesburg
Teresa W. Haynes, East Tennessee State UniversityFollow
Lucas van der Merwe, University of Tennessee at Chattanooga

Document Type

Article

Publication Date

12-4-2015

Description

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.

Citation Information

Desormeaux, Wyatt J.; Haynes, Teresa W.; and van der Merwe, Lucas. 2015. Connected Domination Stable Graphs Upon Edge Addition. Quaestiones Mathematicae. Vol.38(6). 841-848. https://doi.org/10.2989/16073606.2014.981738 ISSN: 1607-3606