Vadim E. Zverovich

Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich: Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discrete Applied Mathematics 161(4-5): 604-611 (2013)

Andrei Gagarin, Vadim E. Zverovich: The bondage number of graphs on topological surfaces and Teschner's conjecture. Discrete Mathematics 313(6): 796-808 (2013)

Andrei V. Gagarin, Vadim E. Zverovich: Upper bounds for the bondage number of graphs on topological surfaces. Discrete Mathematics 313(11): 1132-1137 (2013)

Vadim E. Zverovich, Erel Avineri: Braess' Paradox in a Generalised Traffic Network. CoRR abs/1207.3251 (2012)

Andrei Gagarin, Vadim E. Zverovich: The bondage number of graphs on topological surfaces and Teschner's conjecture. CoRR abs/1209.1362 (2012)

Vadim E. Zverovich, Anush Poghosyan: On Roman, Global and Restrained Domination in Graphs. Graphs and Combinatorics 27(5): 755-768 (2011)

Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich: Preface. Discrete Mathematics 310(2): 197-198 (2010)

Anush Poghosyan, Vadim E. Zverovich: Discrepancy and signed domination in graphs and hypergraphs. Discrete Mathematics 310(15-16): 2091-2099 (2010)

Andrei Gagarin, Vadim E. Zverovich: Upper bounds for the bondage number of graphs on topological surfaces. CoRR abs/1012.4117 (2010)

Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich: Upper Bounds for alpha-Domination Parameters. Graphs and Combinatorics 25(4): 513-520 (2009)

Vadim E. Zverovich: The k-tuple domination number revisited. Appl. Math. Lett. 21(10): 1005-1011 (2008)

Andrei Gagarin, Vadim E. Zverovich: A generalised upper bound for the k-tuple domination number. Discrete Mathematics 308(5-6): 880-885 (2008)

Vadim E. Zverovich: The Computer System GRAPHOGRAPH. Electronic Notes in Discrete Mathematics 27: 109-110 (2006)

Vadim E. Zverovich: The Computer System GRAPHOGRAPH. ACiD 2006: 160

Igor E. Zverovich, Vadim E. Zverovich: Basic perfect graphs and their extensions. Discrete Mathematics 293(1-3): 291-311 (2005)

Igor E. Zverovich, Vadim E. Zverovich: The Domination Parameters of Cubic Graphs. Graphs and Combinatorics 21(2): 277-288 (2005)

Igor E. Zverovich, Vadim E. Zverovich: Locally Well-Dominated and Locally Independent Well-Dominated Graphs. Graphs and Combinatorics 19(2): 279-288 (2003)

Lutz Volkmann, Vadim E. Zverovich: A disproof of Henning's conjecture on irredundance perfect graphs. Discrete Mathematics 254(1-3): 539-554 (2002)

Lutz Volkmann, Vadim E. Zverovich: Proof of a conjecture on irredundance perfect graphs. Journal of Graph Theory 41(4): 292-306 (2002)

Dieter Rautenbach, Vadim E. Zverovich: Perfect graphs of strong domination and independent strong domination. Discrete Mathematics 226(1-3): 297-311 (2001)

Igor E. Zverovich, Vadim E. Zverovich: A semi-induced subgraph characterization of upper domination perfect graphs. Journal of Graph Theory 31(1): 29-49 (1999)

Gregory Gutin, Vadim E. Zverovich: Upper domination and upper irredundance perfect graphs. Discrete Mathematics 190(1-3): 95-105 (1998)

Vadim E. Zverovich: The ratio of the irredundance number and the domination number for block-cactus graphs. Journal of Graph Theory 29(3): 139-149 (1998)

R. I. Tyshkevich, Vadim E. Zverovich: Line hypergraphs. Discrete Mathematics 161(1-3): 265-283 (1996)

Igor E. Zverovich, Vadim E. Zverovich: An induced subgraph characterization of domination perfect graphs. Journal of Graph Theory 20(3): 375-395 (1995)

Igor E. Zverovich, Vadim E. Zverovich: Disproof of a Conjecture in the Domination Theory. Graphs and Combinatorics 10(2-4): 389-396 (1994)

Igor E. Zverovich, Vadim E. Zverovich: Contributions to the theory of graphic sequences. Discrete Mathematics 105(1-3): 293-303 (1992)

Igor E. Zverovich, Vadim E. Zverovich: A characterization of domination perfect graphs. Journal of Graph Theory 15(2): 109-114 (1991)