Trees With Unique Minimum Paired-Dominating Sets

Document Type

Review

Publication Date

10-1-2004

Description

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. We characterize the trees having unique minimum paired-dominating sets.

This document is currently not available here.

Share

COinS