Recognizability of Being Point Determining

M. H. Shirdareh Haghighi, A. Namazi, Z Rahimi +1

A graph $G$ is point determining, if no two vertices have the same neighborhoods. In this paper, we show that this property is recognizable from the deck of cards of a graph.