All Outputs (2)

Randomized algorithms and upper bounds for multiple domination in graphs and networks (2013)
Journal Article
Gagarin, A., Poghosyan, A., & Zverovich, V. (2013). Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discrete Applied Mathematics, 161(4-5), 604-611. https://doi.org/10.1016/j.dam.2011.07.004

We consider four different types of multiple domination and provide new improved upper bounds for the k- and k-tuple domination numbers. They generalize two classical bounds for the domination number and are better than a number of known upper bounds... Read More about Randomized algorithms and upper bounds for multiple domination in graphs and networks.

Basic perfect graphs and their extensions (2005)
Journal Article
Zverovich, I. E., & Zverovich, V. (2005). Basic perfect graphs and their extensions. Discrete Mathematics, 293(1-3), 291-311. https://doi.org/10.1016/j.disc.2004.08.033

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti et al. (Square-free perfect graphs, J. Combin. Theory Ser. B, 90 (2) (2004) 257-307), and it plays... Read More about Basic perfect graphs and their extensions.