1 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2015
Secure Domination in Digraphs
Martin Manrique, Karam Ebadi, Morteza Ebrahimi
Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V -…
math.CO2013★ 1 cited
Majority out-dominating sets in digraphs
Karam Ebadi, Martín Manrique, Reza Jafary +1
The concept of majority domination in graphs has been defined in at least two different ways: As a function and as a set. In this work we extend the latter concept to digraphs, whi…
math.CO2013★ 1 cited
Majority out-dominating functions in digraphs
Martín Manrique, Karam Ebadi, Akbar Azami
At least two different notions have been published under the name "majority domination in graphs": Majority dominating functions and majority dominating sets. In this work we exten…