{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.34775",
  "author_total": 4,
  "authors": [
    {
      "name": "M. H. Shirdareh Haghighi"
    },
    {
      "name": "A. Namazi"
    },
    {
      "name": "Z Rahimi"
    },
    {
      "name": "A. M. Ghazanfari"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5ytxfdvcr1q73.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.34775",
  "fulltext_url": null,
  "id": "5ytxfdvcr1q73",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.34775",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7214745990",
  "pdf_url": "https://arxiv.org/pdf/2609.34775",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-28",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5ytxfdvcr1q73.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:17Z",
      "native_id": "2609.34775",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.34775"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Recognizability of Being Point Determining",
  "title_text": "Recognizability of Being Point Determining",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:17Z",
  "url": "https://research.draconitic.com/paper/5ytxfdvcr1q73",
  "venue": "arXiv",
  "versions": []
}