Point determination in graphs

A point determining graph is defined to be a graph in which distinct nonadjacent points have distinct neighborhoods. Those graphs which are critical with respect to this property are studied. We show that a graph is complete if and only if it is connected, point determining, but fails to remain point determining upon the removal of any edge. We also show that every connected, point determining graph contains at least two points, the removal of either of which will result again in a point determining graph. Graphs which are point determining and contain exactly two such points are shown to have the property that every point is adjacent to exactly one of these two points.