2 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
Factorisation of the complete graph into spanning regular factors
Mahdieh Hasheminezhad, Brendan D. McKay
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The…
Factorisation of the complete bipartite graph into spanning semiregular factors
Mahdieh Hasheminezhad, Brendan D. McKay
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are s…
Complexity results for -domination and -domination problems and their variants
Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad
Let be a simple and undirected graph. For some integer , a set is said to be a k-dominating set in if every vertex of outside has…