Making a dominating set of a graph connected
type: Item
instance of: scholarly article
title: Making a dominating set of a graph connected
zbMATH Open document ID: 1392.05089
author: Hengzhe Li
author: Baoyindureng Wu
author: Weihua Yang
publication date: 2018-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6916580
zbMATH Keywords: independent set
zbMATH Keywords: dominating set
zbMATH Keywords: connected dominating set
MaRDI profile type: Publication
full work available at URL: dmgt.2053
OpenAlex ID: W2794258796
cites work: Q4351076
cites work: Some inequalities about connected domination number
cites work: \(k\)-domination and \(k\)-independence in graphs: A survey
cites work: Permutation graphs: Connected domination and Steiner trees
cites work: Connected dominating set. Theory and applications
cites work: A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
cites work: On Hadwiger's Number and the Stability Number
cites work: Approximation algorithms for connected dominating sets
cites work: Tighter approximation bounds for minimum CDS in unit disk graphs
cites work: Two algorithms for minimum 2-connected \(r\)-hop dominating set
cites work: Doubly chordal graphs, steiner trees, and connected domination
cites work: Q3895508
cites work: Steiner trees, connected domination and strongly chordal graphs
cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs
cites work: Wireless networking, dominating and packing
DOI: 10.7151/DMGT.2053
Wikidata QID: Q130125957
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6916580