PROMOTING ACCESS TO AFRICAN RESEARCH

Quaestiones Mathematicae

Log in or Register to get access to full text downloads.

Remember me or Register



DOWNLOAD FULL TEXT Open Access  DOWNLOAD FULL TEXT Subscription or Fee Access

Connected domination stable graphs upon edge addition

Wyatt J. Desormeaux, Teresa W. Haynes, Lucas van der Merwe

Abstract


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.

Keywords: Connected domination, connected domination stable, edge addition




http://dx.doi.org/10.2989/16073606.2014.981738
AJOL African Journals Online