Equality of unlabelled point-determining and endpoint-free graphs

Point-determining graph conjecture. The number of unlabelled point-determining graphs of a given order equals the number of unlabelled endpoint-free graphs of that order.

This proposes an enumerative correspondence between two classes of graphs, but the supplied text gives no definitions or evidence establishing the equality or indicating its status.