Perfect Domination Excellent Trees

A set D of vertices of a graph G is a perfect dominating set if every vertex in
V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some perfect dominating set of minimum cardinality. We also provide a constructive characterization of perfect domination excellent trees.