Bounds for the connected domination number of maximal outerplanar graphs

A dominating set of a graph G is a set S⊆V(G) such that every vertex in G is either in S or adjacent to a vertex in S. A dominating set S is a connected dominating set if the subgraph of G induced by S is connected. The minimum cardinality of a connected dominating set of G is the connected dominati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 320; S. 235 - 244
Hauptverfasser:	Chen, Shao-Liang, Hao, Rong-Xia, Qin, Xiao-Wen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 30.10.2022
Schlagworte:	Connected dominating set Connected domination number Constructive algorithm Maximal outerplanar graph Constructive algorithm Maximal outerplanar graph Connected dominating set Connected domination number
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!