M. Hasheminezhad

most citedComplexity results for

k

-domination and

α

-domination problems and their variants

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

collaborators

2 papers

math.CO2026

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence

Catherine Greenhill, Mahdieh Hasheminezhad, Isaiah Iliffe +1

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This ena…

cs.CC2017★ 2 cited

Complexity results for $k$ -domination and $α$ -domination problems and their variants

Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad

Let $G = (V, E)$ be a simple and undirected graph. For some integer $k \geq 1$ , a set $D \subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has…

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence

Complexity results for k-domination and α-domination problems and their variants

Complexity results for $k$ -domination and $α$ -domination problems and their variants