Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 15 min ago
PreprintarXiv licencearXiv

Recognizability of Being Point Determining

  • M. H. Shirdareh Haghighi
  • A. Namazi
  • Z Rahimi
  • A. M. Ghazanfari
Open at sourcePDFDOICite

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.

Related

  1. Point sets determining few angles are almost contained in a line or circle
    Krishnendu Bhowmick, Oliver Roche-Newton, Audie Warren
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Recognizability equals CMSO-definability for graphs of rank-width at most two
    Antonios Kalampakas
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  3. Determining norm-Euclidean complex cubic fields
    Gustav Kjærbye Bagger, Andrew R. Booker, Tim Trudgian
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Determining the Rearrangement Number
    Vinicius de Oliveira Rodrigues
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  5. Determining Schrodinger Potentials on Riemannian Manifolds
    Lu Chen, Yan Jiang, Hongyu Liu +1
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv

Cite

BibTeXRIS
BibTeX
@misc{haghighi2026recognizability,
  title = {{Recognizability of Being Point Determining}},
  author = {M. H. Shirdareh Haghighi and A. Namazi and Z Rahimi and A. M. Ghazanfari},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.34775},
  eprint = {2609.34775},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.34775},
}
RIS
TY  - UNPB
TI  - Recognizability of Being Point Determining
AU  - M. H. Shirdareh Haghighi
AU  - A. Namazi
AU  - Z Rahimi
AU  - A. M. Ghazanfari
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.34775
UR  - https://arxiv.org/abs/2609.34775
AB  - 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.
ER  -