Article

Connected Domination Stable Graphs Upon Edge Addition

Published in: Quaestiones Mathematicae
Volume 38 , issue 6 , 2015 , pages: 841–848

DOI: 10.2989/16073606.2014.981738

Author(s): Wyatt J. Desormeaux Department of Mathematics, South Africa , Teresa W. Haynes Department of Mathematics and Statistics, USA , Lucas van der Merwe Department of Mathematics, USA

Keywords: 05C69 , 05C69

Download full text Get new issue alerts

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.

« The formal theory of Hopf algebras Part II: The case of Hopf algebras

Some generalizations and unifications of C_K (X), Cψ(X) AND C∞(X) »