Darko Dimitrov

1.5k total citations
58 papers, 1.1k citations indexed

About

Darko Dimitrov is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Organic Chemistry. According to data from OpenAlex, Darko Dimitrov has authored 58 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Geometry and Topology, 42 papers in Computational Theory and Mathematics and 21 papers in Organic Chemistry. Recurrent topics in Darko Dimitrov's work include Graph theory and applications (46 papers), Computational Drug Discovery Methods (30 papers) and Free Radicals and Antioxidants (11 papers). Darko Dimitrov is often cited by papers focused on Graph theory and applications (46 papers), Computational Drug Discovery Methods (30 papers) and Free Radicals and Antioxidants (11 papers). Darko Dimitrov collaborates with scholars based in Germany, Slovenia and China. Darko Dimitrov's co-authors include Hosam Abdo, Wei Gao, Weifan Wang, Yiqiao Wang, Riste Škrekovski, Akbar Ali, Zhibin Du, Stephan Brandt, Xiujun Zhang and İvan Gutman and has published in prestigious journals such as SHILAP Revista de lepidopterología, PLoS ONE and IEEE Access.

In The Last Decade

Darko Dimitrov

53 papers receiving 1.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Darko Dimitrov Germany 19 727 706 386 104 78 58 1.1k
Abdul Qudair Baig Pakistan 18 710 1.0× 796 1.1× 368 1.0× 104 1.0× 46 0.6× 80 1.2k
B. Basavanagoud India 12 280 0.4× 280 0.4× 151 0.4× 44 0.4× 48 0.6× 54 548
Rong Luo China 16 126 0.2× 349 0.5× 61 0.2× 162 1.6× 13 0.2× 110 826
Junfang Li China 16 219 0.3× 97 0.1× 118 0.3× 101 1.0× 7 0.1× 82 982
Xiaoyu Liu China 16 145 0.2× 99 0.1× 104 0.3× 42 0.4× 52 0.7× 51 812
Hualong Wu China 7 93 0.1× 114 0.2× 47 0.1× 37 0.4× 44 0.6× 17 347
Farkhanda Afzal Pakistan 17 242 0.3× 236 0.3× 104 0.3× 28 0.3× 7 0.1× 79 715
Guotao Wang China 29 180 0.2× 96 0.1× 43 0.1× 39 0.4× 25 0.3× 146 2.8k
Jason I. Brown Canada 15 408 0.6× 545 0.8× 20 0.1× 6 0.1× 38 0.5× 105 892
Xing Peng China 15 59 0.1× 94 0.1× 209 0.5× 56 0.5× 17 0.2× 91 964

Countries citing papers authored by Darko Dimitrov

Since Specialization
Citations

This map shows the geographic impact of Darko Dimitrov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Darko Dimitrov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Darko Dimitrov more than expected).

Fields of papers citing papers by Darko Dimitrov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Darko Dimitrov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Darko Dimitrov. The network helps show where Darko Dimitrov may publish in the future.

Co-authorship network of co-authors of Darko Dimitrov

This figure shows the co-authorship network connecting the top 25 collaborators of Darko Dimitrov. A scholar is included among the top collaborators of Darko Dimitrov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Darko Dimitrov. Darko Dimitrov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ali, Akbar, Darko Dimitrov, Tamás Réti, Abeer M. Albalahi, & Amjad E. Hamza. (2025). Bounds and Optimal Results for the Total Irregularity Measure. match Communications in Mathematical and in Computer Chemistry. 94(1). 5–29. 1 indexed citations
2.
Ali, Akbar, et al.. (2025). Degree-based graphical indices of $ k $-cyclic graphs. AIMS Mathematics. 10(6). 13540–13554. 2 indexed citations
3.
Dimitrov, Darko, et al.. (2025). The σ -irregularity of trees with maximum degree 5. Discrete Applied Mathematics. 382. 124–136.
4.
Albalahi, Abeer M., et al.. (2024). Bond Incident Degree Indices of Connected (n,m)-Graphs With Fixed Maximum Degree. match Communications in Mathematical and in Computer Chemistry. 92(3). 607–630. 1 indexed citations
5.
Ашрафи, Али Реза, et al.. (2023). On the irregularity of graphs based on the arithmetic-geometric mean inequality. Mathematical Inequalities & Applications. 151–160.
6.
Ali, Akbar, Yilun Shang, Darko Dimitrov, & Tamás Réti. (2023). Ad-Hoc Lanzhou Index. Mathematics. 11(20). 4256–4256. 2 indexed citations
7.
Dimitrov, Darko & Zhibin Du. (2023). Complete characterization of the minimal-ABC trees. Discrete Applied Mathematics. 336. 148–194. 3 indexed citations
8.
Dimitrov, Darko & Zhibin Du. (2023). The ABC Index Conundrum's Complete Solution. match Communications in Mathematical and in Computer Chemistry. 91(1). 5–38. 3 indexed citations
9.
Liu, Jianping, et al.. (2023). New Bounds on the Energy of Graphs with Self-Loops. match Communications in Mathematical and in Computer Chemistry. 91(3). 779–796.
10.
Ali, Akbar, Kinkar Chandra Das, Darko Dimitrov, & Boris Furtula. (2021). Atom–bond connectivity index of graphs: a review over extremal results and bounds. SHILAP Revista de lepidopterología. 5(1). 68–93. 26 indexed citations
11.
Dimitrov, Darko & Akbar Ali. (2019). On the extremal graphs with respect to the variable sum exdeg index. SHILAP Revista de lepidopterología. 4 indexed citations
12.
Dimitrov, Darko, et al.. (2018). Maximum external Wiener index of graphs. Discrete Applied Mathematics. 257. 331–337. 4 indexed citations
13.
Abdo, Hosam, Darko Dimitrov, & İvan Gutman. (2017). On extremal trees with respect to the F-index. SHILAP Revista de lepidopterología. 44(3). 11 indexed citations
14.
Dimitrov, Darko, et al.. (2017). Remarks on maximum atom-bond connectivity index with given graph parameters. Discrete Applied Mathematics. 222. 222–226. 19 indexed citations
15.
Dimitrov, Darko. (2015). On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B1- and B2-branches. Discrete Applied Mathematics. 204. 90–116. 28 indexed citations
16.
Dimitrov, Darko, et al.. (2014). Graphs with Equal Irregularity Indices. Acta Polytechnica Hungarica. 11(4). 17 indexed citations
17.
Réti, Tamás, et al.. (2013). On Irregularities of Bidegreed Graphs. Acta Polytechnica Hungarica. 10(7). 6 indexed citations
18.
Dimitrov, Darko, Tomáš Dvořák, Petr Gregor, & Riste Škrekovski. (2012). Linear time construction of a compressed Gray code. European Journal of Combinatorics. 34(1). 69–81. 2 indexed citations
19.
Abdo, Hosam, Darko Dimitrov, & İvan Gutman. (2011). On the Zagreb indices equality. Discrete Applied Mathematics. 160(1-2). 1–8. 9 indexed citations
20.
Dimitrov, Darko, et al.. (2008). Polychromatic colorings of rectangular partitions. Discrete Mathematics. 309(9). 2957–2960. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026