Amir Mohammad Ghazanfari

collaborators

2 papers

math.CO2026

Recognizability of Being Point Determining

M. H. Shirdareh Haghighi, A. Namazi, Z Rahimi +1

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.

math.CO2024

Distinguishing Polynomials of Graphs

Mohammad Hassan Shirdareh Haghighi, Amir Mohammad Ghazanfari, Seyed Ali Reza Talebpour Shirazi Fard

For a graph $G$ , a $k$ -coloring $c : V (G) \to {1, 2, \dots, k}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c (v) = c (f (v))$ for every vertex $v\in…