56 citations · 156 across the 13 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013
Efficient computation of trees with minimal atom-bond connectivity index
Darko Dimitrov
The {\em atom-bond connectivity (ABC) index} is one of the recently most investigated degree-based molecular structure descriptors, that have applications in chemistry. For a graph…
cs.DM2013
The Total Irregularity of Graphs under Graph Operations
Hosam Abdo, Darko Dimitrov
The total irregularity of a graph is defined as $\irr_t(G)=1/2 \sum_{u,v \in V(G)}$ , where denotes the degree of a vertex . In this paper…