On maximizing private neighbors in graphs

Stephen T. Hedetniemi, Douglas F. Rall

Given a set $U\subset V$ of vertices in a graph $G=(V,E)$, a {\it private neighbor with respect to the set $U$} is any vertex $w\in V$ having precisely one neighbor, say $v$,…