Persons: Dobrynin, Andrey Alekseevich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Dobrynin, Andrey Alekseevich

Total publications:	138 (138)
in MathSciNet:	76 (76)
in zbMATH:	48 (48)
in Web of Science:	60 (60)
in Scopus:	46 (46)
Cited articles:	57
Citations:	1451

Number of views:
This page:	2159
Abstract pages:	3980
Full texts:	1546
References:	301

Associate professor

Candidate of physico-mathematical sciences (1998)

Speciality:

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), 1071 https://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–121 https://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. Klavžar, P. Ž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

https://www.mathnet.ru/eng/person17774

https://scholar.google.com/citations?user=fm0QE2MAAAAJ&hl=en

https://zbmath.org/authors/?q=ai:dobrynin.andrey-a

https://mathscinet.ams.org/mathscinet/MRAuthorID/244192

https://elibrary.ru/author_items.asp?spin=4030-2710

https://orcid.org/0000-0003-0074-8388

https://publons.com/researcher/1745282

https://www.webofscience.com/wos/author/record/H-5505-2016

https://www.scopus.com/authid/detail.url?authorId=7006539537

Full list of scientific publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)

Articles

1.	A. A. Dobrynin, K. V. Vorob'ev, “Some results on the Wiener index related to the Šoltés problem of graphs”, Discrete Appl. Math., 344 (2024), 154–160	1 ^[x]
2.	A. A. Dobrynin, H. Golmohammadi, “On cubic graphs having the maximum coalition number”, Sib. Electron. Math. Rep., 21:1 (2024), 363–369 http://semr.math.nsc.ru/v21/n1/p0363-0369.pdf
3.	A. A. Dobrynin, H. Golmohammadi, “The shortest cycle having the maximal number of coalition graphs”, Discrete Math. Lett., 14 (2024), 21–26 https://www.dmlett.com/archive/v14/DML24_v14_pp21-26.pdf
4.	A. A. Dobrynin, “A new 4-chromatic edge critical Koester graph”, Discr. Math. Lett., 12 (2023), 6-10 https://www.dmlett.com/archive/v12/DML23_v12_pp6-10.pdf	1 ^[x]
5.	A. A. Dobrynin, “On the preservation of the Wiener index of cubic graphs upon vertex removal”, Siberian Electronic Math. Reports, 12:1 (2023), 285-292 http://semr.math.nsc.ru/v20/n1/p285-292.pdf
6.	A. A. Dobrynin, “Edge 4-critical Koester graph of order 28”, Siberian Electronic Math. Reports, 20:2 (2023), 847–853
7.	A. A. Dobrynin, A. Yu. Vesnin, “On the Wiener (r,s)-complexity of fullerene graphs”, Fuller. Nanotub. Carbon Nanostructures, 30:5 (2022), 508–511 https://www.tandfonline.com/doi/full/10.1080/1536383X.2021.1960511	3 ^[x]
8.	A. A. Dobrynin, “On the Wiener index of two families generated by joining a graph to a tree”, Discrete Mathematics Letters, 9 (2022), 44-48 https://www.dmlett.com/archive/v9/DML22_v9_pp44-48.pdf	1 ^[x]
9.	A. A. Dobrynin, “Wiener index of families of unicyclic graphs obtained from a tree”, MATCH Commun. Math. Comput. Chem., 88:2 (2022), 461–470 https://match.pmf.kg.ac.rs/electronic_versions/Match88/n2/match88n2_461-470.pdf	3 ^[x]
10.	A. Yu. Bezhaev, A. A. Dobrynin, “Cubic transmission irregular graphs of an arbitrary order”, Mathematics, 10:15 (2022), 2741	2 ^[x]
11.	A. A. Dobrynin, “On the Wiener index of the forest induced by contraction of edges in a tree”, MATCH Commun. Math. Comput. Chem., 86:2 (2021), 321–326
12.	A. Yu. Bezhaev, A. A. Dobrynin, “On quartic transmission irregular graphs”, Applied Math. Comput., 399 (2021), article 126049	4 ^[x]
13.	A. A. Dobrynin, R. Sharafdini, “Stepwise transmission irregular graphs”, Applied Math. Comput., 371 (2020), 124949	5 ^[x]
14.	A. A. Dobrynin, O. Ori, M. V. Putz, A. Yu. Vesnin, “Generalized topological efficiency – case study with C84 fullerene”, Fuller. Nanotub. Carbon Nanostructures, 2020 https://www.tandfonline.com/doi/abs/10.1080/1536383X.2020.1719482	8 ^[x]
15.	A. A. Dobrynin, E. Estaji, “Wiener index of hexagonal chains under some transformations”, Open J. Discret. Appl. Math., 3:1 (2020), 28–35 https://pisrt.org/psrpress/j/odam/2020/1/6/wiener-index-of-hexagonal-chains-under-some-transformations.pdf	7 ^[x]
16.	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	4 ^[x]
17.	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	11 ^[x]
18.	A. A. Dobrynin, “Infinite family of 2-connected transmission irregular graphs”, Applied Math. Comput., 340:1 (2019), 1–4	8 ^[x]
19.	A. A. Dobrynin, “Infinite family of transmission irregular trees of even order”, Discrete Math., 342 (2019), 74–77	18 ^[x]
20.	A. A. Dobrynin, “Infinite family of 3-connected cubic transmission irregular graphs”, Discrete Appl. Math., 257 (2019), 151–157	13 ^[x]
21.	A. A. Dobrynin, “Wiener index of uniform hypergraphs induced by trees”, Open J. Discret. Appl. Math., 2:3 (2019), 19–22 https://pisrt.org/psrpress/j/odam/2019/3/3/wiener-index-of-uniform-hypergraphs-induced-by-trees.pdf	2 ^[x]
22.	A. A. Dobrynin, “Wiener index of subdivisions of a tree”, Siberian Electronic Math. Reports, 16 (2019), 1581–1586 http://semr.math.nsc.ru/v16/p1581-1586.pdf	1 ^[x]
23.	A. A. Dobrynin, A. Yu. Vesnin, “On the Wiener complexity and the Wiener index of fullerene graphs”, Mathematics, 7:11 (2019), 1071 https://www.mdpi.com/2227-7390/7/11/1071	11 ^[x]
24.	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
25.	A. Youseﬁ, A. Iranmanesh, A. A. Dobrynin, A. Tehranian, “A multiplicative version of forgotten topological index”, Math. Interdisc. Res., 4 (2019), 193-211 mir.kashanu.ac.ir/article_102000.html
26.	A. A. Dobrynin, “The Szeged and Wiener indices of line graphs”, MATCH Commun. Math. Comput. Chem., 79:3 (2018), 743–756 match.pmf.kg.ac.rs/electronic_versions/Match79/n3/match79n3_743-756.pdf
27.	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–6 http://it-in-industry.com/itii_papers/2018/6118itii01.pdf
28.	A. A. Dobrynin, “On 2-connected transmission irregular graphs”, J. Appl. Industrial Math., 12:4 (2018), 642–647
29.	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–239 ijmc.kashanu.ac.ir/article_70875.html
30.	A. A. Dobrynin, “Hexagonal chains with segments of equal lengths having distinct sizes and the same Wiener Index”, MATCH Commun. Math. Comput. Chem., 78:1 (2017), 121–132 match.pmf.kg.ac.rs/electronic_versions/Match78/n1/match78n1_121-132.pdf
31.	Yu. E. Bessonov, A. A. Dobrynin, “Lattice complete graphs”, J. Applied and Industrial Math., 11:4 (2017), 1–7
32.	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	6 ^[x]
33.	A. A. Dobrynin, A. Yu. Vesnin, “On deletion-contraction polynomials for polycyclic chains”, MATCH Commun. Math. Comput. Chem., 72:3 (2014), 845–864 match.pmf.kg.ac.rs/electronic_versions/Match72/n3/match72n3_845-864.pdf
34.	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–114 https://match.pmf.kg.ac.rs/mcm16a.html
35.	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	31 ^[x]
36.	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–40 http://novtex.ru/IT/it2014/It1214_web.pdf
37.	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–27 konf.ict.nsc.ru/files/conferences/dicr2014/fulltext/249005/250429/shokin_i_dr_web.pdf
38.	A. A. Dobrynin, “On the Wiener index of certain families of fibonacenes”, MATCH Commun. Math. Comput. Chem., 70:2 (2013), 565–574 match.pmf.kg.ac.rs/electronic_versions/Match70/n2/match70n2_565-574.pdf
39.	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–639 http://www.mit.rs/2013/zbornik-2013.pdf
40.	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–646 www.mit.rs/2013/zbornik-2013.pdf
41.	A. A. Dobrynin, L. S. Melnikov, “4-chromatic Koester graphs”, Discussiones Mathematicae Graph Theory, 32:4 (2012), 617–627	1 ^[x]
42.	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–121 https://match.pmf.kg.ac.rs/mcm12.html
43.	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
44.	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
45.	A. A. Dobrynin, “On the Wiener index of fibonacenes”, MATCH Commun. Math. Comput. Chem., 64:3 (2010), 707–726 match.pmf.kg.ac.rs/electronic_versions/Match64/n3/match64n3_707-726.pdf
46.	A. A. Dobrynin, “The Wiener Index for Graphs of Arbitrary Girth and Their Edge Graphs”, J. Appl. Industr. Math., 4:4 (2010), 505–511
47.	A. A. Dobrynin, L. S. Melnikov, “4-chromatic edge critical Grotzsch-Sachs graphs”, Discrete Math., 309:8 (2009), 2564–2566	3 ^[x]
48.	A. A. Dobrynin, L. S. Mel'nikov, “Two series of edge-$4$-critical Grötzsch–Sachs graphs generated by four curves in the plane”, Sib. elektron. matem. izv., 5 (2008), 255–278	1 ^[x]
49.	A. A. Dobrynin, L. S. Melnikov, “Infinite families of 4-chromatic Grotzsch-Sachs graphs”, J. Graph Theory, 59:4 (2008), 279–292	3 ^[x]
50.	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
51.	A. A. Dobrynin, L. S. Mel'nikov, A. V. Pyatkin, “Erdös regular graphs of even degree”, Discussiones Mathematicae Graph Theory, 27:2 (2007), 269–279
52.	A. A. Dobrynin, L. S. Melnikov, “Counterexamples to Grötzsch-Sachs-Koesters conjecture”, Discrete Math., 306:6 (2006), 591–594	5 ^[x]
53.	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	2 ^[x]
54.	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
55.	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	15 ^[x]
56.	A. A. Dobrynin, L. S. Melnikov, “Wiener index, line graphs and the cyclomatic number”, MATCH Commun. Math. Comput. Chem., 53:1 (2005), 209–214 match.pmf.kg.ac.rs/electronic_versions/Match53/n1/match53n1_209-214.pdf
57.	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	9 ^[x]
58.	A. A. Dobrynin, L. S. Melnikov, “Indeks Vinera dlya grafov i ikh rebernykh grafov”, Diskretn. analiz i issled. oper., 11:2 (2004), 25–44	5 ^[x]
59.	A. A. Dobrynin, L. S. Melnikov, “Trees, quadratic line graphs and Wiener index”, Croat. Chem. Acta, 77:3 (2004), 477–480 hrcak.srce.hr/file/151499
60.	A. A. Dobrynin, L. S. Melnikov, A. V. Pyatkin, “Regular 4-critical graphs of even degree”, J. Graph Theory, 46:2 (2004), 103–130	1 ^[x]
61.	A. A. Dobrynin, L. S. Melnikov, “Trees and their quadratic line graphs having the same Wiener index”, MATCH Commun. Math. Comput. Chem., 50 (2004), 145–164 match.pmf.kg.ac.rs/electronic_versions/Match50/match50_145-164.pdf
62.	I. Gutman, A. A. Dobrynin, S. Klavžar, L. Pavlović, “Wiener-type invatiants of trees and their relation”, Bulletin ICA, 40 (2004), 23–30
63.	A. A. Dobrynin, L. S. Melnikov, A. V. Pyatkin, “Kriticheskie grafy Erdësha i Diraka chetnoi stepeni”, Diskretn. analiz i issled. oper., 10:3 (2003), 12–22	1 ^[x]
64.	A. A. Dobrynin, A. Yu. Vesnin, “On the Yoshinaga polynomial of spatial graphs”, Kobe J. Math., 20:1/2 (2003), 31–37
65.	A. A. Dobrynin, “Wiener index decomposition based on vertex degrees of catacondensed benzenoid graphs”, MATCH Commun. Math. Comput. Chem., 49 (2003), 37–46 match.pmf.kg.ac.rs/electronic_versions/Match49/match49_37-46.pdf
66.	A. A. Dobrynin, “On the Wiener index decomposition for catacondensed benzenoid graphs”, Indian J. Chem., 42A:6 (2003), 1270–1271
67.	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	1 ^[x]
68.	A. A. Dobrynin, I. Gutman, S. Klavžar, P. Žigert, “Wiener index of hexagonal systems”, Acta Applicandae Mathematicae, 72:3 (2002), 247–294	203 ^[x]
69.	A. A. Dobrynin, L. S. Mel'nikov, J. Schreyer, H. Walther, “Some news about oblique graphs”, Discussiones Mathematicae Graph Theory, 22:1 (2002), 39–50	1 ^[x]
70.	A. A. Dobrynin, L. S. Mel'nikov, “Recent results in the theory of the path layer matrix”, Graph Theory Notes New York, 43 (2002), 48–56
71.	A. A. Dobrynin, R. Entringer, I. Gutman, “Wiener index for trees: theory and applications”, Acta Applicandae Mathematicae, 66:3 (2001), 211–249	644 ^[x]
72.	A. A. Dobrynin, “Cubic graphs without cut-vertices having the same path layer matrix”, J. Graph Theory, 38:3 (2001), 177–182	1 ^[x]
73.	A. A. Dobrynin, L. S. Melnikov, “Path layer matrix for weighted graphs”, MATCH Commun. Math. Comput. Chem., 44 (2001), 135–146 match.pmf.kg.ac.rs/electronic_versions/Match44/match44_135-146.pdf
74.	L. S. Melnikov, A. A. Dobrynin, “Postroenie trekhsvyaznykh grafov s sovpadayuschimi tsepnymi matritsami sloev”, Diskretn. analiz i issled. oper., 7:2 (2000), 60–73	1 ^[x]
75.	G. Brinkmann, A. A. Dobrynin, A. Krause, “Fast generation of polycyclic chains with arbitrary ring sizes”, MATCH Commun. Math. Comput. Chem., 41 (2000), 137–144 match.pmf.kg.ac.rs/electronic_versions/Match41/match41_137-144.pdf
76.	A. A. Dobrynin, “Branchings in trees and the calculation of the Wiener index of a tree”, MATCH Commun. Math. Comput. Chem., 41 (2000), 119–134 match.pmf.kg.ac.rs/electronic_versions/Match41/match41_119-134.pdf
77.	A. A. Dobrynin, “Explicit relation between the Wiener index and the Schultz index of catacondensed benzenoid graphs”, Croat. Chem. Acta, 72:4 (1999), 869–874 https://hrcak.srce.hr/file/195318
78.	A. A. Dobrynin, I. Gutman, “Average Wiener index of graphs of hexagonal systems”, Computers Chem., 23:6 (1999), 571–576	11 ^[x]
79.	A. A. Dobrynin, I. Gutman, “Average Wiener index of trees and chemical trees”, J. Chem. Inf. Comput. Sci., 39:4 (1999), 679–683	10 ^[x]
80.	A. A. Dobrynin, I. Gutman, V. N. Piottukh-Peletskii, “Hyper-Wiener index for acyclic structures”, J. Struct. Chem., 40:2 (1999), 293–298
81.	A. A. Dobrynin, “A simple formula for the calculation of the Wiener index of hexagonal chains”, Computers Chem., 23:1 (1999), 43–48	10 ^[x]
82.	A. A. Dobrynin, “Distance of iterated line graphs”, Graph Theory Notes New York, 37 (1999), 8–9
83.	G. Caporossi, A. A. Dobrynin, I. Gutman, P. Hansen, “Trees with palindromic Hosoya polynomials”, Graph Theory Notes New York, 37 (1999), 10–16
84.	I. Gutman, A. A. Dobrynin, “The Szeged index - a success story”, Graph Theory Notes New York, 34 (1998), 37–44
85.	A. A. Dobrynin, I. Gutman, “Indeks Vinera dlya derevev i grafov geksagonalnykh sistem”, Diskretn. analiz i issled. oper., 5:2 (1998), 34–60	18 ^[x]
86.	A. A. Dobrynin, “Discriminating power of the Schultz index for catacondensed benzenoid graphs”, MATCH Commun. Math. Comput. Chem., 38 (1998), 19–32 match.pmf.kg.ac.rs/electronic_versions/Match38/match38_19-32.pdf
87.	A. A. Dobrynin, “Formula for calculating the Wiener index of catacondensed benzenoid graphs”, J. Chem. Inf. Comput. Sci., 38:5 (1998), 811–814	8 ^[x]
88.	A. A. Dobrynin, “New congruence relations for the Wiener index of cata-condensed benzenoid graphs”, J. Chem. Inf. Comput. Sci., 38:3 (1998), 405–409	4 ^[x]
89.	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	9 ^[x]
90.	A. A. Dobrynin, “Congruence relations for the Wiener index of hexagonal chains”, J. Chem. Inf. Comput. Sci., 37:6 (1997), 1109–1110	3 ^[x]
91.	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
92.	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
93.	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	30 ^[x]
94.	A. A. Dobrynin, “Graphs having the maximal value of the Szeged index”, Croat. Chem. Acta, 70:3 (1997), 819–825 https://hrcak.srce.hr/file/200084
95.	A. A. Dobrynin, “The Szeged index for complements of hexagonal chains”, MATCH Commun. Math. Comput. Chem., 35 (1997), 227–242 match.pmf.kg.ac.rs/electronic_versions/Match35/match35_227-242.pdf
96.	A. A. Dobrynin, “A new formula for the calculation of the Wiener index of hexagonal chains”, MATCH Commun. Math. Comput. Chem., 35 (1997), 75–90 match.pmf.kg.ac.rs/electronic_versions/Match35/match35_75-90.pdf
97.	A. A. Dobrynin, I. Gutman, “Szeged index of some polycyclic bipartite graphs with circuits of different size”, MATCH Commun. Math. Comput. Chem., 35 (1997), 117–128 match.pmf.kg.ac.rs/electronic_versions/Match35/match35_117-128.pdf
98.	I. Gutman, V. Jovašević, 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
99.	A. A. Dobrynin, I. Gutman, “On the Szeged index of unbranched catacondensed benzenoid molecules”, Croat. Chem. Acta, 69:3 (1996), 845–856 https://hrcak.srce.hr/file/261125
100.	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	2 ^[x]
101.	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
102.	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
103.	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
104.	A. A. Dobrynin, I. Gutman, G. Dömötör, “A Wiener-type graph invariant for some bipartite graphs”, Appl. Math. Lett., 8:5 (1995), 57–62	14 ^[x]
105.	P. V. Khadikar, N. V. Deshpande, P. P. Kale, A. A. Dobrynin, I. Gutman, G. Dömötör, “The Szeged index and an analogy with the Wiener index”, J. Chem. Inf. Comput. Sci., 35:5 (1995), 547–550	115 ^[x]
106.	A. A. Dobrynin, I. Gutman, “Solving a problem connected with distances in graphs”, Graph Theory Notes New York, 28 (1995), 21–23
107.	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
108.	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	150 ^[x]
109.	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
110.	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
111.	A. A. Dobrynin, “Graphs with palindromic Wiener polynomials”, Graph Theory Notes New York, 27 (1994), 50–54
112.	A. A. Dobrynin, “Degeneracy of some matrix graph invariants”, J. Math. Chem., 14:1 (1993), 175–184	3 ^[x]
113.	A. A. Dobrynin, “Cubic graphs with 62 vertices having the same path layer matrix”, J. Graph Theory, 17:1 (1993), 1–4	4 ^[x]
114.	A. A. Dobrynin, “Generation of graphs of unbranched pentahexagonal systems”, Croat. Chem. Acta, 66:1 (1993), 91–100 https://hrcak.srce.hr/file/202065
115.	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
116.	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
117.	A. A. Dobrynin, “On decomposition of the Wiener index for graphs of catacondensed hexagonal systems”, Graph Theory Notes New York, 25 (1993), 19–22
118.	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
119.	A. A. Dobrynin, “Graph distance numbers of nonbranched hexagonal systems”, Siber. Adv. Math., 2:3 (1992), 121–134
120.	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	4 ^[x]
121.	A. A. Dobrynin, “Path enumerations and similarity of graphs”, Graph Theory Notes New York, 23 (1992), 7–9
122.	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
123.	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
124.	A. A. Dobrynin, “Regular graphs having the same path layer matrix”, J. Graph Theory, 14:2 (1990), 141–148	7 ^[x]
125.	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
126.	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
127.	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
128.	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
129.	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
130.	V. A. Skorobogatov, A. A. Dobrynin, “Metric analysis of graphs”, MATCH Commun. Math. Comput. Chem., 23 (1988), 105–151 match.pmf.kg.ac.rs/electronic_versions/Match23/match23_105-151.pdf
131.	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
132.	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
133.	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
134.	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
135.	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
136.	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
137.	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
138.	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

Organisations

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Registration to the website

Logotypes

Articles