Work

Recognizability of Being Point Determining

Year: 2026

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.34775

Authors: Haghighi, M. H. Shirdareh, Namazi, A., Rahimi, Z, Ghazanfari, A. M.

Institution: Shiraz University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7214745990

Cites:

Cited by:

Related to: 10