Making a dominating set of a graph connected

DOI10.7151/DMGT.2053MaRDI QIDQ1656909zbMATH OpenOpenAlexWikidataFDO

Authors Hengzhe Li, Baoyindureng Wu, Weihua Yang

Publication date 10 August 2018

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

dominating setindependent setconnected dominating set

Mathematics Subject Classification ID

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

Recommendations

• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• Publication:3340900
• Some results on characterizing the edges of connected graphs with a given domination number
• An inequality on connected domination parameters
• Publication:4871064

Cites work

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

Cited in

(9)

• Nordhaus-Gaddum-type results on the connected edge domination number
• A proof of a conjecture on the connected domination number
• The extended dominating sets in graphs
• How to make a strongly connected digraph two-connected
• 2-(edge-)connected edge domination number and matching number
• A note on connected domination number and leaf number
• Connected domination
• Connected domination in random graphs
• 2-connected graphs with small 2-connected dominating sets.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1656909)