Making a dominating set of a graph connected

DOI10.7151/dmgt.2053zbMath1392.05089OpenAlexW2794258796MaRDI QIDQ1656909

Baoyindureng Wu, Weihua Yang, Hengzhe Li

Publication date: 10 August 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2053

zbMATH Keywords

independent setdominating setconnected dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (3)

Connected domination in random graphs ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ Connected Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Connected dominating set. Theory and applications
• Tighter approximation bounds for minimum CDS in unit disk graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
• Some inequalities about connected domination number
• Permutation graphs: Connected domination and Steiner trees
• Approximation algorithms for connected dominating sets
• Two algorithms for minimum 2-connected \(r\)-hop dominating set
• Wireless networking, dominating and packing
• On Hadwiger's Number and the Stability Number
• Steiner trees, connected domination and strongly chordal graphs
• Doubly chordal graphs, steiner trees, and connected domination

This page was built for publication: Making a dominating set of a graph connected