#### Filter Results:

#### Publication Year

2009

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Andrei V. Gagarin, Anush Poghosyan, Vadim E. Zverovich
- Discrete Applied Mathematics
- 2013

Disclaimer UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited. UWE makes no… (More)

- Andrei V. Gagarin, Anush Poghosyan, Vadim E. Zverovich
- Graphs and Combinatorics
- 2009

In this paper, we provide a new upper bound for the α-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic construction is used to generalise another well-known upper bound for the classical domination in graphs. We also prove similar upper bounds for the α-rate domination… (More)

In this article, we investigate a domination set problem variant on vertex-weighted graphs. In the last few years, several algorithms have been presented for solving the minimum alpha and alpha-rate domination problem (also known as the positive influence dominating sets problem) on simple graphs. We recently proposed an algorithm for alpha-rate domination… (More)

- Vadim E. Zverovich, Anush Poghosyan
- Graphs and Combinatorics
- 2011

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 give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination… (More)

- Anush Poghosyan, Vadim E. Zverovich
- Discrete Mathematics
- 2010

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's than –1's. This concept is closely related to combinatorial discrepancy theory as shown by Füredi and Mubayi [J. The signed domination number of G is the minimum of the sum of… (More)

- Anush Poghosyan
- 2010

- ‹
- 1
- ›