Abstract
Let α2(G), γ(G) and γc(G) be the 2-independence number, the domination number, and the connected domination number of a graph G respectively. Then α2(G) ≤ γ (G) ≤ γc(G). In this paper , we present a simple heuristic for Minimum Connected Dominating Set in graphs. When running on a graph G excluding Km (the complete graph of order m) as a minor, the heuristic produces a connected dominating set of cardinality at most 7α2(G) - 4 if m = 3, or at most [Formula: see text] if m ≥ 4. In particular, if running on a planar graph G, the heuristic outputs a connected dominating set of cardinality at most 15α2(G) - 5.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
