05.13.16 (Computer techniques, mathematical modelling, and mathematical methods with an application to scientific researches)
Birth date:
7.02.1960
E-mail:
Keywords:
distance in graphs; metric invariants of graphs; Wiener index; algorithms on graphs; applications of graph theory.
Subject:
graph theory and its applications
Main publications:
A. Yu. Bezhaev, A. A. Dobrynin, “On quartic transmission irregular graphs”, Applied Math. Comput., 399 (2021), article 126049
A. A. Dobrynin, A. Yu. Vesnin, “On the Wiener complexity and the Wiener index of fullerene graphs”, Mathematics, 7:11 (2019), 1071https://www.mdpi.com/2227-7390/7/11/1071
A. A. Dobrynin, “Wiener index of hexagonal chains with segments of equal length”, Quantitative graph theory: mathematical foundations and applications, Discrete mathematics and its applications, eds. M. Dehmer, F. Emmert-Streib, Chapman and Hall/CRC, 2014, 81–109
A. A. Dobrynin, L. S. Melnikov, “4-chromatic Koester graphs”, Discussiones Mathematicae Graph Theory, 32:4 (2012), 617–627
A. A. Dobrynin, L. S. Melnikov, “Wiener index of line graphs”, Distance in molecular graphs – Theory, Mathematical chemistry monographs, 12, eds. I. Gutman, B. Furtula, University of Kragujevac, Kragujevac, Serbia, 2012, 85–121https://match.pmf.kg.ac.rs/mcm12.html
A. A. Dobrynin, L. S. Melnikov, A. V. Pyatkin, “Regular 4-critical graphs of even degree”, J. Graph Theory, 46:2 (2004), 103–130
A. A. Dobrynin, I. Gutman, S. Klavžar, P. Žigert, “Wiener index of hexagonal systems”, Acta Applicandae Mathematicae, 72:3 (2002), 247–294
A. A. Dobrynin, R. Entringer, I. Gutman, “Wiener index for trees: theory and applications”, Acta Applicandae Mathematicae, 66:3 (2001), 211–249
A. A. Dobrynin, A. A. Kochetova, “Degree distance of a graph: a degree analogue of the Wiener index”, J. Chem. Inf. Comput. Sci., 34:5 (1994), 1082–1086
A. A. Dobrynin, K. V. Vorob'ev, “Some results on the Wiener index related to the Šoltés problem of graphs”, Discrete Appl. Math., 344 (2024), 154–160
A. A. Dobrynin, H. Golmohammadi, “On cubic graphs having the maximum coalition number”, Sib. Electron. Math. Rep., 21:1 (2024), 363–369http://semr.math.nsc.ru/v21/n1/p0363-0369.pdf
A. A. Dobrynin, “On the preservation of the Wiener index of cubic graphs upon vertex removal”, Siberian Electronic Math. Reports, 12:1 (2023), 285-292http://semr.math.nsc.ru/v20/n1/p285-292.pdf
7.
A. A. Dobrynin, “Edge 4-critical Koester graph of order 28”, Siberian Electronic Math. Reports, 20:2 (2023), 847–853
A. A. Dobrynin, A. Iranmanesh, “Wiener index of edge thorny graphs of catacondensed benzenoids”, Mathematics, 8:4 (2020), 467 , 14 pp. https://www.mdpi.com/2227-7390/8/4/467
A. A. Dobrynin, E. Estaji, “Wiener index of certain families of hexagonal chains”, Journal of Applied Mathematics and Computing, 59:1-2 (2019), 245–256
A. A. Dobrynin, A. Yu. Vesnin, “On the Wiener complexity and the Wiener index of fullerene graphs”, Mathematics, 7:11 (2019), 1071https://www.mdpi.com/2227-7390/7/11/1071
A. A. Dobrynin, V. R. Rosenfeld, “Enumeration of pentahexagonal annuli in the plane”, Mathematics, 7:12 (2019), 1156 , 12 pp. https://www.mdpi.com/2227-7390/7/12/1156
26.
A. Yousefi, A. Iranmanesh, A. A. Dobrynin, A. Tehranian, “A multiplicative version of forgotten topological index”, Math. Interdisc. Res., 4 (2019), 193-211mir.kashanu.ac.ir/article_102000.html
M. Dehmer, A. A. Dobrynin, O. A. Klimenko, E. V. Konstantinova, A. N. Medvedev, E. V. Rychkova, Yu. I. Shokin, A. Yu. Vesnin, “Analysis of webspaces of the Siberian Branch of the Russian Academy of Sciences and the Fraunhofer-Gesellschaft”, Information Technology in Industry, 6:1 (2018), 1–6http://it-in-industry.com/itii_papers/2018/6118itii01.pdf
29.
A. A. Dobrynin, “On 2-connected transmission irregular graphs”, J. Appl. Industrial Math., 12:4 (2018), 642–647
30.
A. Yousefi, A. Iranmanesh, A. A. Dobrynin, A. Tehranian, “The F-index for some special graphs and some properties of the F-index”, Iranian J. Math. Chem., 9:3 (2018), 167–239ijmc.kashanu.ac.ir/article_70875.html
Yu. E. Bessonov, A. A. Dobrynin, “Lattice complete graphs”, J. Applied and Industrial Math., 11:4 (2017), 1–7
2016
33.
V. R. Rosenfeld, A. A. Dobrynin, J. M. Oliva, J. Rue, “Pentagonal chains and annuli as models for designing nanostructures from cages”, J. Math. Chem., 54:3 (2016), 765–776
M. Dehmer, A. A. Dobrynin, “The uniqueness of topological indices: classical and recent results”, Topics in chemical graph theory, Mathematical chemistry monographs, 16a, eds. I. Gutman, University of Kragujevac, Kragujevac, 2014, 99–114https://match.pmf.kg.ac.rs/mcm16a.html
36.
A. A. Dobrynin, “Wiener index of hexagonal chains with segments of equal length”, Quantitative graph theory: mathematical foundations and applications, Discrete mathematics and its applications, eds. M. Dehmer, F. Emmert-Streib, Chapman and Hall/CRC, 2014, 81–109
Yu. I. Shokin , A. Yu. Vesnin, A. A. Dobrynin, O. A. Klimenko, E. V. Rychkova, “Analiz veb-prostranstva akademicheskikh soobschestv metodami vebometriki i teorii grafov”, Informatsionnye tekhnologii, 2014, no. 12, 31–40http://novtex.ru/IT/it2014/It1214_web.pdf
38.
Yu. I. Shokin, A. Yu. Vesnin, A. A. Dobrynin, O. A. Klimenko, E. V. Rychkova, M. Ya. Filippova, “Postroenie i issledovanie matematicheskoi modeli veb-prostranstva”, Trudy XV Rossiiskoi konf. s uchastiem inostrannykh uchenykh “Raspredelennye informatsionnye i vychislitelnye resursy — DICR-2014” (Novosibirsk, Rossiya, 2–5 dekabrya 2014 g.), IVT SO RAN, Novosibirsk, 2014, 1–27konf.ict.nsc.ru/files/conferences/dicr2014/fulltext/249005/250429/shokin_i_dr_web.pdf
Yu. I. Shokin, A. Yu. Vesnin, A. A. Dobrynin, O. A. Klimenko, E. V. Rychkova, “Izuchenie struktury veb-prostranstva SO RAN metodami vebometriki i teorii grafov”, Trudy mezhdunar. konf. “Matematicheskie i informatsionnye tekhnologii, MIT-2013” (Vrnyachka Banya, Serbiya, 5–8 sentyabrya 2013), Prirodno-matematicki fakultet Univerziteta u Pristini, Kosovska Mitrovica, Serbia, 2013, 629–639http://www.mit.rs/2013/zbornik-2013.pdf
41.
E. V. Rychkova, Yu. I. Shokin, A. Yu. Vesnin, O. A. Klimenko, A. A. Dobrynin, I. S. Petrov, “Issledovanie nauchnogo veb-prostranstva Respubliki Serbiya”, Trudy mezhdunar. konf. “Matematicheskie i informatsionnye tekhnologii, MIT-2013” (Vrnyachka Banya, Serbiya, 5–8 sentyabrya 2013), Prirodno-matematicki fakultet Univerziteta u Pristini, Kosovska Mitrovica, Serbia, 2013, 640–646www.mit.rs/2013/zbornik-2013.pdf
2012
42.
A. A. Dobrynin, L. S. Melnikov, “4-chromatic Koester graphs”, Discussiones Mathematicae Graph Theory, 32:4 (2012), 617–627
A. A. Dobrynin, L. S. Melnikov, “Wiener index of line graphs”, Distance in molecular graphs – Theory, Mathematical chemistry monographs, 12, eds. I. Gutman, B. Furtula, University of Kragujevac, Kragujevac, Serbia, 2012, 85–121https://match.pmf.kg.ac.rs/mcm12.html
44.
Yu. I. Shokin, A. Yu. Vesnin, A. A. Dobrynin, O. A. Klimenko, E. V. Rychkova, I. S. Petrov, “Issledovanie nauchnogo veb-prostranstva Sibirskogo otdeleniya Rossiiskoi akademii nauk”, Vychislitelnye tekhnologii, 17:6 (2012), 86–98
45.
A. A. Dobrynin, “Dekompozitsiya indeksa Vinera dlya grafov geksagonalnykh tsepei”, Informatsionnye tekhnologii v prikladnykh issledovaniyakh, 2, eds. A. L. Osipov, Izdatelstvo NGUEiU, Novosibirsk, 2012, 70–77
A. A. Dobrynin, L. S. Mel'nikov, “Two series of edge-$4$-critical Grötzsch–Sachs graphs generated by four curves in the plane”, Sib. elektron. matem. izv., 5 (2008), 255–278
A. A. Dobrynin, L. S. Melnikov, “Raskraska grafov Gretssha-Zaksa”, Doklady Odesskogo seminara po diskretnoi matematike, 8, eds. A. A. Zykov, Izdatelstvo Druk, Odessa, 2008, 14–24
2007
52.
A. A. Dobrynin, L. S. Mel'nikov, A. V. Pyatkin, “Erdös regular graphs of even degree”, Discussiones Mathematicae Graph Theory, 27:2 (2007), 269–279
2006
53.
A. A. Dobrynin, L. S. Melnikov, “Counterexamples to Grötzsch-Sachs-Koesters conjecture”, Discrete Math., 306:6 (2006), 591–594
A. A. Dobrynin, L. S. Mel'nikov, “Wiener index of generalized stars and their quadratic line graphs”, Discussiones Mathematicae Graph Theory, 26:1 (2006), 161–175
Kh. Valter, A. A. Dobrynin, L. S. Melnikov, I. Shreier, “Chislo kosykh poliedralnykh grafov s malym chislom vershin”, Problemy intellektualizatsii i kachestva sistem informatiki, 13, eds. V. N. Kasyanov, Izdatelstvo ISI SO RAN, Novosibirsk, 2006, 34–41
2005
56.
A. A. Dobrynin, L. S. Melnikov, “Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers”, Appl. Math. Lett., 18:3 (2005), 307–312
A. A. Dobrynin, L. S. Mel'nikov, “Some results on the Wiener index of iterated line graphs”, Electronic Notes in Discrete Mathematics, 22 (2005), 469–475
I. Gutman, A. A. Dobrynin, S. Klavžar, L. Pavlović, “Wiener-type invatiants of trees and their relation”, Bulletin ICA, 40 (2004), 23–30
2003
64.
A. A. Dobrynin, L. S. Melnikov, A. V. Pyatkin, “Kriticheskie grafy Erdësha i Diraka chetnoi stepeni”, Diskretn. analiz i issled. oper., 10:3 (2003), 12–22
A. A. Dobrynin, “On the Wiener index decomposition for catacondensed benzenoid graphs”, Indian J. Chem., 42A:6 (2003), 1270–1271
68.
A. A. Dobrynin, L. S. Melnikov, A. V. Pyatkin, “On 4-chromatic edge-critical regular graphs of high connectivity”, Discrete Math., 260:1-3 (2003), 307–313
L. S. Melnikov, A. A. Dobrynin, “Postroenie trekhsvyaznykh grafov s sovpadayuschimi tsepnymi matritsami sloev”, Diskretn. analiz i issled. oper., 7:2 (2000), 60–73
A. A. Dobrynin, “Explicit relation between the Wiener index and the Schultz index of catacondensed benzenoid graphs”, Croat. Chem. Acta, 72:4 (1999), 869–874https://hrcak.srce.hr/file/195318
79.
A. A. Dobrynin, I. Gutman, “Average Wiener index of graphs of hexagonal systems”, Computers Chem., 23:6 (1999), 571–576
A. A. Dobrynin, I. Gutman, V. Iovashevich, “Bitsiklicheskie grafy i ikh rebernye grafy s sovpadayuschim indeksom Vinera”, Diskretn. analiz i issled. oper., 4:2 (1997), 3–9
A. A. Dobrynin, I. Gutman, “Congruence relations for the Szeged index of hexagonal chains”, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat., 8 (1997), 106–113
93.
M. V. Diudea, C. M. Pop, G. Katona, A. A. Dobrynin, “Dual descriptors in the calculation of Wiener index”, J. Serb. Chem. Soc., 62:3 (1997), 241–250
94.
I. Gutman, W. Linert, I. Lukovits, A. A. Dobrynin, “Trees with extremal Hyper-Wiener index: mathematical basis and chemical applications”, J. Chem. Inf. Comput. Sci., 37:2 (1997), 349–354
I. Gutman, V. Jovašević, A. A. Dobrynin, “Smallest graphs for which the distance of the graph is equal to the distance of its line graph”, Graph Theory Notes New York, 33 (1997), 19
1996
100.
A. A. Dobrynin, I. Gutman, “On the Szeged index of unbranched catacondensed benzenoid molecules”, Croat. Chem. Acta, 69:3 (1996), 845–856https://hrcak.srce.hr/file/261125
101.
F. Zhang, J. Brunvoll, S. J. Cyvin, B. N. Cyvin, X. Guo, A. A. Dobrynin, “Theory of helicenic hydrocarbons. Part 5: irreducible helicenes and their enumeration”, Stuct. Chemistry, 7:2 (1996), 263–271
A. Yu. Vesnin, A. A. Dobrynin, “Polinom Yamady dlya grafov, zauzlenno vlozhennykh v trekhmernoe prostranstvo”, Teoriya grafov i ee primeneniya, Vychislitelnye sistemy, 155, eds. V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1996, 37–86
103.
B. N. Cyvin, S. J. Cyvin, J. Brunvoll, A. A. Dobrynin, “Enumeration of unbranched catacondensed systems of congruent polygons”, Teoriya grafov i ee primeneniya, Vychislitelnye sistemy, 155, eds. V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1996, 3–14
104.
A. A. Dobrynin, A. Yu. Vesnin, “On a recursive polynomial graph invariant for chains of polygons”, Teoriya grafov i ee primeneniya, Vychislitelnye sistemy, 155, eds. V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1996, 87–102
1995
105.
A. A. Dobrynin, I. Gutman, G. Dömötör, “A Wiener-type graph invariant for some bipartite graphs”, Appl. Math. Lett., 8:5 (1995), 57–62
P. V. Khadikar, N. V. Deshpande, P. P. Kale, A. A. Dobrynin, I. Gutman, G. Dömötör, “The Szeged index and an analogy with the Wiener index”, J. Chem. Inf. Comput. Sci., 35:5 (1995), 547–550
A. A. Dobrynin, I. Gutman, “Solving a problem connected with distances in graphs”, Graph Theory Notes New York, 28 (1995), 21–23
1994
108.
A. A. Dobrynin, I. Gutman, “On a graph invariant related to the sum of all distances in a graph”, Publ. de l'Institut Math., 56 (1994), 18–22
109.
A. A. Dobrynin, A. A. Kochetova, “Degree distance of a graph: a degree analogue of the Wiener index”, J. Chem. Inf. Comput. Sci., 34:5 (1994), 1082–1086
A. A. Dobrynin, “Postroenie grafov s palindromnym polinomom Vinera”, Teoriya grafov i ee prilozheniya, Vychislitelnye sistemy, 151, eds. V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1994, 37–54
111.
A. Yu. Vesnin, A. A. Dobrynin, “Polinom Negami grafov, sostavlennykh iz mnogougolnikov”, Teoriya grafov i ee prilozheniya, Vychislitelnye sistemy, 151, eds. V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1994, 3–36
112.
A. A. Dobrynin, “Graphs with palindromic Wiener polynomials”, Graph Theory Notes New York, 27 (1994), 50–54
1993
113.
A. A. Dobrynin, “Degeneracy of some matrix graph invariants”, J. Math. Chem., 14:1 (1993), 175–184
A. A. Dobrynin, “Generation of graphs of unbranched pentahexagonal systems”, Croat. Chem. Acta, 66:1 (1993), 91–100https://hrcak.srce.hr/file/202065
116.
A. A. Dobrynin, “Izmenenie distantsii pri lokalnykh preobrazovaniyakh grafov s tsiklami nechetnoi dliny”, Prilozheniya teorii grafov v khimii, Vychislitelnye sistemy, 149, eds. N. G. Zagoruiko, V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1993, 3–50
117.
A. A. Dobrynin, “Nekotorye svoistva distantsii grafov nerazvetvlennykh pentagonalnykh sistem”, Prilozheniya teorii grafov v khimii, Vychislitelnye sistemy, 149, eds. N. G. Zagoruiko, V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1993, 84–108
118.
A. A. Dobrynin, “On decomposition of the Wiener index for graphs of catacondensed hexagonal systems”, Graph Theory Notes New York, 25 (1993), 19–22
119.
A. A. Dobrynin, “Postroenie maksimalnykh planarnykh eilerovykh grafov”, Prilozheniya teorii grafov v khimii, Vychislitelnye sistemy, 149, eds. N. G. Zagoruiko, V. A. Skorobogatov, Izdatelstvo IM SO RAN, Novosibirsk, 1993, 126–131
1992
120.
A. A. Dobrynin, “Graph distance numbers of nonbranched hexagonal systems”, Siber. Adv. Math., 2:3 (1992), 121–134
121.
A. A. Dobrynin, “Graphs of unbranched hexagonal systems with the same Wiener index and different number of rings”, J. Math. Chem., 9:3 (1992), 239–252
A. A. Dobrynin, “Path enumerations and similarity of graphs”, Graph Theory Notes New York, 23 (1992), 7–9
1991
123.
A. A. Dobrynin, V. A. Skorobogatov, “Metricheskie invarianty podgrafov molekulyarnykh grafov”, Matematicheskie metody v khimicheskoi informatike, Vychislitelnye sistemy, 140, eds. V. A. Skorobogatov, N. G. Zagoruiko, Institut matematiki SO RAN, Novosibirsk, 1991, 3–62
124.
A. A. Dobrynin, “Generatsiya grafov nerazvetvlennykh pentagonalnykh i pentageksagonalnykh sistem”, Matematicheskie metody v khimicheskoi informatike, Vychislitelnye sistemy, 140, eds. V. A. Skorobogatov, N. G. Zagoruiko, Institut matematiki SO RAN, Novosibirsk, 1991, 243–206
1990
125.
A. A. Dobrynin, “Regular graphs having the same path layer matrix”, J. Graph Theory, 14:2 (1990), 141–148
A. A. Dobrynin, “Raspredelenie znachenii distantsii grafov nerazvetvlennykh geksagonalnykh sistem”, Matematicheskie issledovaniya v khimicheskoi informatike, Vychislitelnye sistemy, 136, eds. V. A. Skorobogatov, N. G. Zagoruiko, Institut matematiki SO RAN, Novosibirsk, 1990, 61–140
127.
A. A. Dobrynin, “Perechislenie nekotorykh podklassov grafov nerazvetvlennykh geksagonalnykh sistem”, Matematicheskie issledovaniya v khimicheskoi informatike, Vychislitelnye sistemy, 136, eds. V. A. Skorobogatov, N. G. Zagoruiko, Izdatelstvo IM SO AN, Novosibirsk, 1990, 16–34
128.
A. A. Dobrynin, E. V. Konstantinova, L. I. Makarov, N. M. Meirmanova, A. A. Paleev, V. A. Skorobogatov, “Programmnyi kompleks METAKhIM”, Matematicheskie issledovaniya v khimicheskoi informatike, Vychislitelnye sistemy, 136, eds. V. A. Skorobogatov, N. G. Zagoruiko, Izdatelstvo IM SO AN, Novosibirsk, 1990, 3–15
1989
129.
A. A. Dobrynin, “Effektivnyi algoritm generatsii grafov nerazvetvlennykh geksagonalnykh sistem”, Matematicheskie voprosy khimicheskoi informatiki, Vychislitelnye sistemy, 130, eds. N. G. Zagoruiko, V. A. Skorobogatov, Institut matematiki SO RAN, Novosibirsk, 1989, 3–38
130.
A. A. Dobrynin, “O naimenshem poryadke kubicheskikh grafov s sovpadayuschei tsepnoi matritsei sloev”, Matematicheskie voprosy khimicheskoi informatiki, Vychislitelnye sistemy, 130, eds. N. G. Zagoruiko, V. A. Skorobogatov, Izdatelstvo IM SO AN, Novosibirsk, 1989, 84–87
A. A. Dobrynin, “Distantsiya grafov kata-kondensirovannykh geksagonalnykh politsiklicheskikh sistem pri ikh preobrazovaniyakh”, Algoritmicheskii analiz grafov i ego primeneniya, Vychislitelnye sistemy, 127, eds. V. A. Skorobogatov, N. G. Zagoruiko, Institut matematiki SO RAN, Novosibirsk, 1988, 3–39
1987
133.
A. A. Dobrynin, “Grafy s sovpadayuschimi polnymi matritsami sloev”, Voprosy algoritmicheskogo analiza strukturnoi informatsii, Vychislitelnye sistemy, 119, eds. N. G. Zagoruiko, V. A. Skorobogatov, Izdatelstvo IM SO AN, Novosibirsk, 1987, 3–12
134.
A. A. Dobrynin, “Grafy s sovpadayuschimi tsepnymi matritsami sloev”, Voprosy algoritmicheskogo analiza strukturnoi informatsii, Vychislitelnye sistemy, 119, eds. N. G. Zagoruiko, V. A. Skorobogatov, Izdatelstvo IM SO AN, Novosibirsk, 1987, 13–33
1986
135.
V. A. Skorobogatov, A. A. Dobrynin, “Vliyanie strukturnykh preobrazovanii grafa na znachenie ego distantsii”, Analiz dannykh v ekspertnykh sistemakh, Vychislitelnye sistemy, 117, eds. N. G. Zagoruiko, Izdatelstvo IM SO AN, Novosibirsk, 1986, 103–113
136.
A. A. Dobrynin, “Distantsiya molekulyarnykh grafov politsiklicheskikh soedinenii”, Analiz dannykh v ekspertnykh sistemakh, Vychislitelnye sistemy, 117, eds. N. G. Zagoruiko, Izdatelstvo IM SO AN, Novosibirsk, 1986, 114-122
1985
137.
A. A. Dobrynin, V. A. Skorobogatov, “Svoistva tsepei grafov i izotopichnost”, Algoritmicheskii analiz strukturnoi informatsii, Vychislitelnye sistemy, 112, eds. V. A. Skorobogatov, Yu. E. Bessonov, Izdatelstvo IM SO AN, Novosibirsk, 1985, 33–45
1984
138.
A. A. Dobrynin, S. Kh. Karabunarliev, O. G. Mekenyan, “Ob odnom algoritme kanonizatsii i opredeleniya orbit grafov”, Algoritmy analiza strukturnoi informatsii, Vychislitelnye sistemy, 103, eds. V. A. Skorobogatov, Izdatelstvo IM SO AN, Novosibirsk, 1984, 74–78
139.
A. A. Dobrynin, “Sravnenie programm obrabotki strukturnoi informatsii”, Algoritmy analiza strukturnoi informatsii, Vychislitelnye sistemy, 103, eds. V. A. Skorobogatov, Izdatelstvo IM SO AN, Novosibirsk, 1984, 90–99
2025
Contact us: