Skip to main content

Research Repository

Advanced Search

Outputs (33)

Automated construction of variable density navigable networks in a 3D indoor environment for emergency response (2016)
Journal Article
Boguslawski, P., Mahdjoubi, L., Zverovich, V., & Fadli, F. (2016). Automated construction of variable density navigable networks in a 3D indoor environment for emergency response. Automation in Construction, 72(2), 115-128. https://doi.org/10.1016/j.autcon.2016.08.041

© 2016 Elsevier B.V. Widespread human-induced or natural threats on buildings and their users have made preparedness and rapid response crucial issues for saving human lives. The ability to identify the paths of egress during an emergency is critical... Read More about Automated construction of variable density navigable networks in a 3D indoor environment for emergency response.

The probabilistic approach to limited packings in graphs (2015)
Journal Article
Zverovich, V., & Gagarin, A. (2015). The probabilistic approach to limited packings in graphs. Discrete Applied Mathematics, 184, 146-153. https://doi.org/10.1016/j.dam.2014.11.017

© 2014 Elsevier B.V. All rights reserved. We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for every vertex vεV(G), |N[v]∩X|≤k, where N[v] is the closed neighbourhoo... Read More about The probabilistic approach to limited packings in graphs.

Braess' paradox in a generalised traffic network (2014)
Journal Article
Zverovich, V., & Avineri, E. (2015). Braess' paradox in a generalised traffic network. Journal of Advanced Transportation, 49(1), 114-138. https://doi.org/10.1002/atr.1269

Copyright © 2014 John Wiley & Sons, Ltd. Braess' paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. The classical network configuration intro... Read More about Braess' paradox in a generalised traffic network.

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.

On Roman, Global and Restrained Domination in Graphs (2011)
Journal Article
Zverovich, V., & Poghosyan, A. (2011). On Roman, Global and Restrained Domination in Graphs. Graphs and Combinatorics, 27(5), 755-768. https://doi.org/10.1007/s00373-010-0992-z

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 do... Read More about On Roman, Global and Restrained Domination in Graphs.

The domination parameters of cubic graphs (2005)
Journal Article
Zverovich, I. E., & Zverovich, V. (2005). The domination parameters of cubic graphs. Graphs and Combinatorics, 21(2), 277-288. https://doi.org/10.1007/s00373-005-0608-1

Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In t... Read More about The domination parameters of cubic graphs.

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.

Locally well-dominated and locally independent well-dominated graphs (2003)
Journal Article
Zverovich, I., & Zverovich, V. (2003). Locally well-dominated and locally independent well-dominated graphs. Graphs and Combinatorics, 19(2), 279-288. https://doi.org/10.1007/s00373-002-0507-7

In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irred... Read More about Locally well-dominated and locally independent well-dominated graphs.