16 citations · 17 across the 4 of their papers we have counts for
4 papers
Total positive influence domination on weighted networks
Danica Vukadinović Greetham, Nathaniel Charlton, Anush Poghosyan
We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominating set problem in weighted networks. Applications of…
Discrepancy and Signed Domination in Graphs and Hypergraphs
A. Poghosyan, V. Zverovich
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and -1 such that the closed neighbourhood of every vertex contains more +1'…
On Roman, Global and Restrained Domination in Graphs
A. Poghosyan, V. Zverovich
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we g…
Upper bounds for alpha-domination parameters
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
In this paper, we provide a new upper bound for the alpha-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The sam…