Recognizability of Being Point Determining
arXiv:2609.34775
Abstract
A graph 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.
This paper is 10 pages, 4 figures, and is submitted