Indexed metadata
Recognizability of Being Point Determining
M. H. Shirdareh Haghighi, A. Namazi, Z Rahimi, A. M. Ghazanfari
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.