M. H. S. Haghighi

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

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…

math.CO2011

On the Erdős-Gyárfás conjecture in claw-free graphs

Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi +1

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from re…

math.CO2011★ 2 cited

Degree-equipartite graphs

Khodakhast Bibak, Mohammad Hassan Shirdareh Haghighi

A graph $G$ of order $2 n$ is called degree-equipartite if for every $n$ -element set $A \subseteq V (G)$ , the degree sequences of the induced subgraphs $G [A]$ and $G [V (G) ∖ A]$ …