Skip to main content

Research Repository

Advanced Search

All Outputs (4)

Braess’ paradox in generalised traffic networks (2013)
Presentation / Conference
Zverovich, V., & Avineri, E. (2013, June). Braess’ paradox in generalised traffic networks. Presented at The 24th British Combinatorial Conference, Royal Holloway, London, UK

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.

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Journal Article
Zverovich, V., & Gagarin, A. (2013). The bondage number of graphs on topological surfaces and Teschner's conjecture. Discrete Mathematics, 313(6), 796-808. https://doi.org/10.1016/j.disc.2012.12.018

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, and improve upper bounds... Read More about The bondage number of graphs on topological surfaces and Teschner's conjecture.