An independent dominating set in the complement of a minimum dominating set of a tree

13 years 4 months ago

Download www.tu-ilmenau.de

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.

Michael A. Henning, Christian Löwenstein, Die

Real-time Traffic

APPML 2010 | Dominating Set | Tree |

claim paper

» Approximating minimum independent dominating sets in wireless networks

» Minimum independent dominating sets of random cubic graphs

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

» Domination and Independence on the Rectangular Torus by Rooks and Bishops

» Optimization problems in multiple subtree graphs

» Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	APPML
Authors	Michael A. Henning, Christian Löwenstein, Dieter Rautenbach

Comments (0)

Sciweavers

An independent dominating set in the complement of a minimum dominating set of a tree

APPML 2010 | Dominating Set | Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers