Darko Dimitrov

On structural properties of trees with minimal atom-bond connectivity index

The {\em atom-bond connectivity (ABC) index} is a degree-based molecular descriptor, that found chemical applications. It is well known that among all connected graphs, the graphs with minimal ABC index are trees. A complete characterization of trees with minimal

On structural properties of trees with minimal atom-bond connectivity index II

ABC

On structural properties of trees with minimal atom-bond connectivity index III

index is still an open problem. In this paper, we present new structural properties of trees with minimal ABC index. Our main results reveal that trees with minimal ABC index do not contain so-called {\em

Bounds on the quality of the PCA bounding boxes

B_k

Note: Polychromatic colorings of rectangular partitions

-branches}, with

Graphs with maximal irregularity

k \geq 5

The irregularity of graphs under graph operations

, and that they do not have more than four

Remarks on maximum atom-bond connectivity index with given graph parameters

B_4

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms

-branches.

New upper bounds on the quality of the PCA bounding boxes in r 2 and r 3

The {\em atom-bond connectivity (ABC) index} is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal