Darko Dimitrov - Concepedia

Author

Darko Dimitrov

Freie Universität Berlin ORCID

Also Known As

Brandt, Stephan, D. Dimitrov, DARKO DIMITROV, Darko Dimitrov, Dimitrov, Darko

Publications

1.5K

Citations

H-Index

Concepts

All Affiliations

Freie Universität Berlin HTW Berlin - University of Applied Sciences University of Ljubljana Higher Education Centre Novo Mesto University of Kragujevac

About

Darko Dimitrov is an author at Freie Universität Berlin specializing in graph theory, discrete mathematics, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	12	323
2	Education	5	5	127
3	Natural Sciences	5	5	186
4	Chemistry	5	5	209
5	Computer Science	4	4	115

Darko Dimitrov

Publications

1.2K

Citations

H-Index

Page 1

	Year	Citations
Nano properties analysis via fourth multiplicative ABC indicator calculating Wei Gao, Weifan Wang, Darko Dimitrov, Arabian Journal of Chemistry	2017	191
Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs Darko Dimitrov, Hosam Abdo Discrete and Continuous Dynamical Systems - S	2018	109
On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices Zehui Shao, Pu Wu, Xiujun Zhang, IEEE Access Planar GraphPrescribed SizeChemistryStructural Graph TheoryWithout Pendent Vertices	2018	107
The total irregularity of a graph Hosam Abdo, Stephan Brandt, Darko Dimitrov Discrete Mathematics & Theoretical Computer Science	2014	101
Graphs with maximal irregularity Hosam Abdo, Nathann Cohen, Darko Dimitrov Filomat Geometric Graph TheoryEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2014	52
On the extremal graphs with respect to bond incident degree indices Akbar Ali, Darko Dimitrov Discrete Applied Mathematics Graph MinorGeometric Graph TheoryGraph TheoryStructural Graph TheoryExtremal Combinatorics	2018	52
Efficient computation of trees with minimal atom-bond connectivity index Darko Dimitrov Applied Mathematics and Computation Tree LanguageEfficient ComputationGraph TheoryEngineeringStructural Graph Theory	2013	47
The irregularity of graphs under graph operations Hosam Abdo, Darko Dimitrov Discussiones Mathematicae Graph Theory	2013	46
Comparing the irregularity and the total irregularity of graphs Darko Dimitrov, Riste Škrekovski Ars Mathematica Contemporanea Geometric Graph TheoryNetwork ScienceGraph TheoryNew MeasureStructural Graph Theory	2014	45
Bounds on the quality of the PCA bounding boxes Darko Dimitrov, Christian Knauer, Klaus Kriegel, Computational Geometry Mathematical ProgrammingComputational Complexity TheoryEngineeringLower BoundComputational Complexity	2009	45

Page 1