Making a Dominating Set of a Graph Connected

Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected (respectively, 2-edge connected or 2-connected). Th...

Full description

Bibliographic Details
Main Authors: Li Hengzhe, Wu Baoyindureng, Yang Weihua
Format: Article
Language:English
Published: University of Zielona Góra 2018-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2053