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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 320; s. 235 - 244
Hlavní autori:	Chen, Shao-Liang, Hao, Rong-Xia, Qin, Xiao-Wen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.10.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!