Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Abrosimov, Mikhail Borisovich
Statistics Math-Net.Ru
Total publications: 60
Scientific articles: 59

Number of views:
This page:2841
Abstract pages:9874
Full texts:5177
References:1432
Professor
Doctor of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person33914
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/724490
https://elibrary.ru/author_items.asp?authorid=175520
https://orcid.org/0000-0002-4473-8790

Publications in Math-Net.Ru Citations
2024
1. A. O. Shabarkova, M. B. Abrosimov, “On the structure of tournaments consisting of only kings”, Prikl. Diskr. Mat. Suppl., 2024, no. 17,  154–156  mathnet
2. M. B. Abrosimov, D. A. Tomilov, “Classification of trees whose maximal subtrees are all isomorphic”, Prikl. Diskr. Mat. Suppl., 2024, no. 17,  135–137  mathnet
2023
3. M. B. Abrosimov, B. A. Terebin, “Optimal Graphs with Prescribed Connectivities”, Mat. Zametki, 113:3 (2023),  323–331  mathnet  mathscinet; Math. Notes, 113:3 (2023), 319–326  scopus
2022
4. A. A. Lobov, M. B. Abrosimov, “Vertex extensions of $4$-layer graphs and hypercubes”, Izv. Saratov Univ. Math. Mech. Inform., 22:4 (2022),  536–548  mathnet
5. A. A. Lobov, M. B. Abrosimov, “About uniqueness of the minimal $1$-edge extension of hypercube $Q_4$”, Prikl. Diskr. Mat., 2022, no. 58,  84–93  mathnet
6. B. A. Terebin, M. B. Abrosimov, “One family of optimal graphs with prescribed connectivities”, Prikl. Diskr. Mat. Suppl., 2022, no. 15,  116–119  mathnet
7. O. V. Modenova, M. B. Abrosimov, “The upper and lower bounds for the number of additional arcs in a minimal edge $1$-extension of oriented cycle”, Prikl. Diskr. Mat. Suppl., 2022, no. 15,  112–116  mathnet
8. A. A. Lobov, M. B. Abrosimov, “About the uniqueness of the minimal $1$-edge extension of a hypercube”, Prikl. Diskr. Mat. Suppl., 2022, no. 15,  110–112  mathnet
2021
9. P. V. Razumovskii, M. B. Abrosimov, “Generation of colored graphs with isomorphism rejection”, Izv. Saratov Univ. Math. Mech. Inform., 21:2 (2021),  267–277  mathnet  elib 2
10. M. B. Abrosimov, I. V. Los', S. V. Kostin, “The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives”, Izv. Saratov Univ. Math. Mech. Inform., 21:2 (2021),  238–245  mathnet  elib 1
11. M. B. Abrosimov, P. V. Razumovskii, “Finding minimal vertex extensions of a colored undirected graph”, University proceedings. Volga region. Physical and mathematical sciences, 2021, no. 4,  106–117  mathnet 1
12. M. B. Abrosimov, S. V. Kostin, I. V. Los, “The maximum number of vertices of primitive regular graphs of orders $2, 3, 4$ with exponent $2$”, Prikl. Diskr. Mat., 2021, no. 52,  97–104  mathnet
13. P. V. Razumovskii, M. B. Abrosimov, “Schemes for constructing minimal vertex $1$-extensions of complete bicolored graphs”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  165–168  mathnet
14. A. A. Lobov, M. B. Abrosimov, “Regular vertex $1$-extension for $2$-dimension meshes”, Prikl. Diskr. Mat. Suppl., 2021, no. 14,  161–163  mathnet
15. P. V. Razumovsky, M. B. Abrosimov, “The minimal vertex extensions for colored complete graphs”, Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 13:4 (2021),  77–89  mathnet
2020
16. M. B. Abrosimov, H. H. K. Sudani, A. A. Lobov, “Construction of all minimal edge extensions of the graph with isomorphism rejection”, Izv. Saratov Univ. Math. Mech. Inform., 20:1 (2020),  105–115  mathnet 5
17. I. A. Kamil, H. H. K. Sudani, A. A. Lobov, M. B. Abrosimov, “Constructing all nonisomorphic supergraphs with isomorphism rejection”, Prikl. Diskr. Mat., 2020, no. 48,  82–92  mathnet
18. B. A. Terebin, M. B. Abrosimov, “On the optimality of graph implementations with prescribed connectivities”, Prikl. Diskr. Mat. Suppl., 2020, no. 13,  103–105  mathnet 3
2019
19. M. B. Abrosimov, I. A. Kamil, A. A. Lobov, “Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives”, Izv. Saratov Univ. Math. Mech. Inform., 19:4 (2019),  479–486  mathnet 6
20. M. B. Abrosimov, “Comparison of sufficient degree based conditions for Hamiltonian graph”, Prikl. Diskr. Mat., 2019, no. 45,  55–63  mathnet 2
21. I. V. Los', M. B. Abrosimov, “About a criterion of equality to 3 for exponent of regular primitive graph”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  182–185  mathnet  elib
22. I. A. Kamil, H. H. K. Sudani, A. A. Lobov, M. B. Abrosimov, “On the generation of minimal graph extensions by the method of canonical representatives”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  179–182  mathnet  elib
23. M. B. Abrosimov, P. V. Razumovskii, “About non-isomorphic graph colouring generating by Read–Faradzhev method”, Prikl. Diskr. Mat. Suppl., 2019, no. 12,  173–176  mathnet  elib 1
2018
24. M. B. Abrosimov, “On a Goodman–Hedetniemi sufficient condition for the graph Hamiltonicity”, Izv. Saratov Univ. Math. Mech. Inform., 18:3 (2018),  347–353  mathnet  elib 1
25. I. V. Los, M. B. Abrosimov, “About the maximum number of vertices in primitive regular graphs with exponent 3”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  112–114  mathnet  elib 1
26. A. A. Lobov, M. B. Abrosimov, “About minimal $1$-edge extension of hypercube”, Prikl. Diskr. Mat. Suppl., 2018, no. 11,  109–111  mathnet  elib 1
2017
27. M. B. Abrosimov, O. V. Modenova, “On minimal vertex $1$-extensions of path orientation”, Prikl. Diskr. Mat., 2017, no. 38,  89–94  mathnet
28. M. B. Abrosimov, P. V. Razumovsky, “About generation of non-isomorphic vertex $k$-colorings”, Prikl. Diskr. Mat. Suppl., 2017, no. 10,  136–138  mathnet 2
29. M. B. Abrosimov, O. V. Modenova, “Upper and lower bounds of the number of additional arcs in a minimal edge $1$-extension of oriented path”, Prikl. Diskr. Mat. Suppl., 2017, no. 10,  134–136  mathnet
30. M. B. Abrosimov, S. V. Kostin, “About primitive regular graphs with exponent 2”, Prikl. Diskr. Mat. Suppl., 2017, no. 10,  131–134  mathnet 3
2016
31. M. B. Abrosimov, O. V. Modenova, “Refinement of lower bounds for the number of additional arcs in a minimal vertex $1$-extension of oriented path”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  101–102  mathnet
2015
32. M. B. Abrosimov, O. V. Modenova, “Number estimation for additional arcs in a minimal $1$-vertex extension of tournament”, Prikl. Diskr. Mat. Suppl., 2015, no. 8,  111–113  mathnet
2013
33. M. B. Abrosimov, O. V. Modenova, “Characterization of graphs with a small number of additional arcs in a minimal $1$-vertex extension”, Izv. Saratov Univ. Math. Mech. Inform., 13:2(2) (2013),  3–9  mathnet 4
34. M. B. Abrosimov, O. V. Modenova, “Characterization of graphs with three additional edges in a minimal $1$-vertex extension”, Prikl. Diskr. Mat., 2013, no. 3(21),  68–75  mathnet 3
35. M. B. Abrosimov, O. V. Modenova, “About the lower bounds for the number of additional arcs in a minimal vertex 1-extension of oriented path”, Prikl. Diskr. Mat. Suppl., 2013, no. 6,  71–72  mathnet
2012
36. M. B. Abrosimov, “On the number of additional edges of a minimal vertex 1-extension of a starlike tree”, Izv. Saratov Univ. Math. Mech. Inform., 12:2 (2012),  103–113  mathnet  elib 1
37. M. B. Abrosimov, “Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension”, Prikl. Diskr. Mat., 2012, no. 1(15),  111–120  mathnet 3
38. M. B. Abrosimov, O. V. Modenova, “On digraphs with a small number of arcs in a minimal $1$-vertex extension”, Prikl. Diskr. Mat. Suppl., 2012, no. 5,  86–88  mathnet
39. M. B. Abrosimov, N. A. Kuznetsov, “On the number of minimal vertex and edge $1$-extensions of cycles”, Prikl. Diskr. Mat. Suppl., 2012, no. 5,  84–86  mathnet 1
40. M. B. Abrosimov, D. D. Komarov, “On a counterexample to a minimal vertex $1$-extension of starlike trees”, Prikl. Diskr. Mat. Suppl., 2012, no. 5,  83–84  mathnet 2
2011
41. M. B. Abrosimov, “Minimal vertex extensions of directed stars”, Diskr. Mat., 23:2 (2011),  93–102  mathnet  mathscinet  elib 6
42. M. B. Abrosimov, “On lower bound of edge number of minimal edge 1-extension of starlike tree”, Izv. Saratov Univ. Math. Mech. Inform., 11:3(2) (2011),  111–117  mathnet 3
43. M. B. Abrosimov, O. V. Modenova, “On properties of minimal extensions of orgraphs”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  84–85  mathnet
44. M. B. Abrosimov, D. D. Komarov, “On minimal edge 1-extensions of two special form trees”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  83–84  mathnet
45. M. B. Abrosimov, A. A. Dolgov, “On the uniqueness of exact vertex extensions”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  81–82  mathnet
46. M. B. Abrosimov, P. P. Bondarenko, “Minimal extensions for cycles with vertices of two types”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  80–81  mathnet
47. M. B. Abrosimov, A. A. Matorin, “Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA”, Prikl. Diskr. Mat., 2011, no. supplement № 4,  40–41  mathnet
48. M. B. Abrosimov, “On minimal vertex 1-extensions of special type graph union”, Prikl. Diskr. Mat., 2011, no. 4(14),  34–41  mathnet
49. M. B. Abrosimov, “Minimal edge extensions of oriented and directed stars”, Prikl. Diskr. Mat., 2011, no. 2(12),  77–89  mathnet
2010
50. M. B. Abrosimov, A. A. Dolgov, “On directed acyclic exact extensions”, Izv. Saratov Univ. Math. Mech. Inform., 10:1 (2010),  83–88  mathnet
51. M. B. Abrosimov, “On the Complexity of Some Problems Related to Graph Extensions”, Mat. Zametki, 88:5 (2010),  643–650  mathnet  mathscinet; Math. Notes, 88:5 (2010), 619–625  isi  scopus 33
52. M. B. Abrosimov, D. D. Komarov, “On minimal vertex 1-extensions of special form superslim trees”, Prikl. Diskr. Mat., 2010, no. supplement № 3,  68–70  mathnet
53. M. B. Abrosimov, “On minimal edge $k$-extensions of oriented stars”, Prikl. Diskr. Mat., 2010, no. supplement № 3,  67–68  mathnet
54. M. B. Abrosimov, “Minimal edge extensions of some precomplete graphs”, Prikl. Diskr. Mat., 2010, no. 1(7),  105–117  mathnet
2009
55. M. B. Abrosimov, A. A. Dolgov, “About reconstruction of small tournaments”, Izv. Saratov Univ. Math. Mech. Inform., 9:2 (2009),  94–98  mathnet
56. M. B. Abrosimov, “Computational complexity of graph extensions”, Prikl. Diskr. Mat., 2009, no. supplement № 1,  94–95  mathnet 2
2008
57. M. B. Abrosimov, A. A. Dolgov, “Семейства точных расширений турниров”, Prikl. Diskr. Mat., 2008, no. 1(1),  101–107  mathnet 3
2006
58. M. B. Abrosimov, “Some questions on minimal extensions of graphs”, Izv. Saratov Univ. Math. Mech. Inform., 6:1-2 (2006),  86–91  mathnet 3
2003
59. M. B. Abrosimov, “Minimal $k$-extensions of precomplete graphs”, Izv. Vyssh. Uchebn. Zaved. Mat., 2003, no. 6,  3–11  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 47:6 (2003), 1–8 6
2016
60. M. B. Abrosimov, S. A. Suhov, “On the number of optimal $1$-hamiltonian graphs with the number of vertices up to $26$ and $28$”, Prikl. Diskr. Mat. Suppl., 2016, no. 9,  103–105  mathnet

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024