The nucleus of a point determining graph

A graph is point determining if distinct points have distinct neighborhoods. In this paper we investigate the nucleus G^0={@[email protected]:[email protected] is point determining} of a point determining graph G. In particular, we characterize those graphs that are the nucleus of some connected point determining graph.