Pooya Hatami

most citedVariations on the Sensitivity Conjecture

7 citations · 14 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CC2010★ 7 cited

Variations on the Sensitivity Conjecture

Pooya Hatami, Raghav Kulkarni, Denis Pankratov

We present a selection of known as well as new variants of the Sensitivity Conjecture and point out some weaker versions that are also open.

cs.DM2010★ 1 cited

On The Signed Edge Domination Number of Graphs

Saeed Akbari, Sadegh Bolouki, Pooya Hatami +1

Let $γ_{s}^{'} (G)$ be the signed edge domination number of G. In 2006, Xu conjectured that: for any $2$ -connected graph G of order $n (n \geq 2),$ $γ_{s}^{'} (G) \geq 1$ . In this article we s…

cs.DS2010

An approximation algorithm for the total cover problem

Pooya Hatami

We introduce a $2$ -approximation algorithm for the minimum total covering number problem.

math.CO2010

Measure preserving homomorphisms and independent sets in tensor graph powers

Babak Behsaz, Pooya Hatami

In this note, we study the behavior of independent sets of maximum probability measure in tensor graph powers. To do this, we introduce an upper bound using measure preserving homo…

cs.DM2010★ 6 cited

On minimum vertex cover of generalized Petersen graphs

Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian

For natural numbers $n$ and $k$ ( $n > 2 k$ ), a generalized Petersen graph $P (n, k)$ , is defined by vertex set ${u_{i}, v_{i}}$ and edge set $\lbrace u_iu_{i+1},u_iv_i,v_iv_{i…

math.CO2007

Perfect dominating sets in the Cartesian products of prime cycles

Hamed Hatami, Pooya Hatami

We study the structure of a minimum dominating set of $C_{2 n + 1}^{n}$ , the Cartesian product of $n$ copies of the cycle of size $2 n + 1$ , where $2 n + 1$ is a prime.