Title

A Characterization of Trees With Unique Minimum Double Dominating Sets

Document Type

Article

Publication Date

11-1-2010

Description

In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a double dominating set if every vertex of V is dominated at least twice by the vertices of S. We give a constructive characterization of trees with unique minimum double dominating sets.

This document is currently not available here.

Share

COinS