Recognizability of Being Point Determining
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.
math.CO↗
arXiv subjects
A. Namazi
Publications and source records attributed to A. Namazi.