Back to my home page

List of Publications

Vadim E. Zverovich, Dr.

  1. Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discrete Applied Mathematics (2011) (available online) [with A. Gagarin and A. Poghosyan]
  2. On Roman, global and restrained domination in graphs. Graphs and Combinatorics 27 (5)(2011) 755-768. [with A. Poghosyan]
  3. Discrepancy and signed domination in graphs and hypergraphs. Discrete Math. 310 (2010) 2091-2099 [with A. Poghosyan]
  4. Upper bounds for alpha-domination parameters. Graphs and Combinatorics 25 (4)(2009), 513-520. [with A. Gagarin and A. Poghosyan]
  5. The k-tuple domination number revisited. Applied Math. Letters 21 (2008) 1005-1011.
  6. A generalised upper bound for the k-tuple domination number. Discrete Math. 308 (2008), 880-885. [with A. Gagarin]
  7. The computer system GRAPHOGRAPH. Electronic Notes in Discrete Math. 27 (2006), 109-110.
  8. A proof of Rautenbach-Volkmann's conjecture on k-tuple domination. Proceedings of the Poznań - Zielona Góra Conference on Combinatorics, October 2006, 1-4.
  9. Basic perfect graphs and their extensions. Discrete Math. 293 (2005), 291-311. [with I.E. Zverovich]
  10. The domination parameters of cubic graphs. Graphs and Combinatorics 21 (2)(2005), 277-288. [with I.E. Zverovich]
  11. Bipartition of graphs into subgraphs with prescribed hereditary properties. Graph Theory Notes of New York  44 (2003), 22-29. [with I.E. Zverovich]
  12. On the differences of the independence, domination and irredundance parameters of a graph. Australasian J. Combin.  27 (2003), 175-185.
  13. Basic graphs. The 19th British Combinatorial Conference, Bangor, June-July 2003, 110-111. [with I.E. Zverovich]
  14. Locally well-dominated and locally independent well-dominated graphs. Graphs and Combinatorics  19 (2)(2003), 279-288. [with I.E. Zverovich]
  15. Proof of a conjecture on irredundance perfect graphs. J. Graph Theory 41 (2002), 292-306. [with L. Volkmann]
  16. A disproof of Henning’s conjecture on irredundance perfect graphs. Discrete Math. 254 (2002), 539-554. [with L. Volkmann]
  17. Perfect graphs of strong domination and independent strong domination. Discrete Math. 226 (2001), 297-311. [with D. Rautenbach]
  18. A semi-induced subgraph characterization of upper domination perfect graphs. J. Graph Theory 31 (1999), 29-49. [with I.E. Zverovich]
  19. The ratio of the irredundance number and the domination number for block-cactus graphs. J. Graph Theory 29 (1998), 139-149.
  20. Line hypergraphs: a survey. Acta Applicandae Math. 52 (1998), 209-222. [with R.I. Tyshkevich]
  21. Upper domination and upper irredundance perfect graphs.  Discrete Math. 190 (1998), 95-105. [with G. Gutin]
  22. A semi-induced subgraph characterization of upper domination perfect graphs. The 16th British Combinatorial Conference, London, July 1997, p. A-111. [with I.E. Zverovich]
  23. The binding number of a random graph. Australasian J. Combin. 15 (1997), 271-275.
  24. A proof of Favaron's conjecture and a disproof of Henning's conjecture on irredundance perfect graphs. The 5th Twente Workshop on Graphs and Combin. Optimisation, Enschede, May 1997, 215-217. [with L. Volkmann]
  25. Line hypergraphs. Discrete Math. 161 (1996), 265-283. [with R.I. Tyshkevich]
  26. An induced subgraph characterization of domination perfect graphs. J. Graph Theory  20 (3)(1995), 375-395. [with I.E. Zverovich]
  27. Disproof of a conjecture in the domination theory. Graphs and Combinatorics (10)(1994), 389-396. [with I.E. Zverovich]  <File 3.5MB>
  28. A proof of Woodall's conjecture on the binding number. Preprint, Belarus State University, Minsk (1993).
  29. Graph-theoretic invariants connected with neighbourhoods of vertex sets. Abstract of PhD Thesis, Belarus State University, Minsk (1993), 16 pp. (in Russian).
  30. A catalogue of connected 4-regular locally connected graphs. Vestnik Bel. Gos. Univ. Ser.I: Fiz. Mat. Mekh. (2)(1993), 74-76 (in Russian). [with I.E. Zverovich and Yu.L. Orlovich]
  31. The binding number for random graphs. Izvest. AN BSSR (1992) (Minsk, dep. VINITI 04.02.92, No. 374-B92), 9 pp. (in Russian).
  32. Graph-theoretic invariants connected with neighbourhoods of vertex sets. PhD Thesis, Belarus State University, Minsk, 1992, 107 pp. (in Russian).
  33. Contributions to the theory of graphic sequences. Discrete Math. 105 (1992), 293-303. [with I.E. Zverovich]
  34. A note on domatically critical and cocritical graphs. Czechoslovak Math. Journal 41 (116)(1991), 278-281. [with I.E. Zverovich]  <File 1.9MB>
  35. A characterization of domination perfect graphs. J. Graph Theory 15 (2)(1991), 109-114. [with I.E. Zverovich]
  36. A characterization of perfect dominating-clique graphs. Izvest. AN BSSR Ser. Fiz.-Mat. Nauk (2)(1991), 107-109 (in Russian). [with I.E. Zverovich]
  37. Graphs with a matroid number that does not exceed 2. Discretnaja Matemat. 2 (2)(1990), 82-88 (in Russian). [with I.E. Zverovich and R.I. Tyshkevich]
  38. Criticality and inequalities in domination theory of graphs. Izvest. AN BSSR Ser. Fiz.-Mat. Nauk (4)(1990), 37-42 (in Russian).
  39. Domination perfect graphs. Mat. Zametki 48 (3)(1990), 66-69 (in Russian).
  40. On the binding number of graphs. Vestnik Bel. Gos. Univ.  Ser.I: Fiz. Mat. Mekh. (1)(1990), 52-55 (in Russian). [with I.E. Zverovich]
  41. Estimations of the binding number of graphs with a large girth. Izvest. Vuzov Mat. (1990) (Kazan, dep. VINITI 07.05.90, No. 2422-B90), 8 pp. (in Russian). [with I.E. Zverovich]
  42. Domination and independence in graphs. The 3rd All-Union Seminar on Discrete Mathematics and Its Applications, Moscow, 1990. [Published in: Proceedings of the Seminar on Discrete Math. and Its Applications (O.B. Lupanov, ed.), Moscow State University, Moscow, 1997, p.170] (in Russian). [with I.E. Zverovich]
  43. Solving industrial problems connected with analysis of chemical compounds. Regional Conference on Actual Problems of Informatics:  Math., Progr. and Inform. Support, Minsk, 1990, 2 pp. (in Russian). [with I.E. Zverovich]
  44. The binding number of a graph. Vestnik Bel. Gos. Univ. Ser.I: Fiz. Mat. Mekh. (1)(1989), 39-43 (in Russian).
  45. Domistable graphs. Vestnik Bel. Gos. Univ. (1989) (Minsk,  dep. VINITI 14.02.89, No. 956-B89), 9 pp. (in Russian). [with I.E. Zverovich]
  46. On domination and irredundance in graphs. Vestnik Bel. Gos. Univ. (1989) (Minsk, dep. VINITI 3.07.89, No. 4378-B89), 15 pp. (in Russian).
  47. Computational aspects of graph-optimisation problems connected with hamiltonity and k-factors. Regional Conference on Applications of Inform. and Comput. to Industr. Problems, Minsk, 1989, p.168 (in Russian). [with I.E. Zverovich]
  48. Conjectures on the binding number of a graph. The 8-th All-Union Conference on Problems of Theoretical Cybernetics, Gorki, 1988, Part 1, 125-126 (in Russian). [with I.E. Zverovich]
  49. Some classes of minimaximal graphs. Izvest. AN BSSR (1988) (Minsk, dep. VINITI 24.06.88, No. 5070-B88), 48 pp. (in Russian). [with I.E. Zverovich]
  50. Some results on forcibly n-colourable and forcibly i-cyclic sequences. Vestnik Bel. Gos. Univ. (1988) (Minsk, dep. VINITI 12.04.88, No. 2790-B88), 16 pp. (in Russian). [with I.E. Zverovich and A. Sylla]
  51. A solution of one problem on domatically cocritical graphs. Vestnik Bel. Gos. Univ. (1988) (Minsk, dep. VINITI 23.03.88, No. 2293-B88), 5 pp. (in Russian).

Back to my home page

Hit Counter