Extremal problems and algorithms for graph in variants based on eingenvalues and distances

Bounds of distance Estrada index of graphs

“…More details on extremal values for the largest distance eigenvalue of a graph can be found in e.g. [13,22,23]. Let K n1,n2,••• ,ns denote the complete s-partite graph.…”

On the harmonic index of bicyclic conjugated molecular graphs

“…In [10], [11] and [12], the authors presented the minimum and maximum values of harmonic index on simple connected graphs, trees, unicyclic graphs and bicyclic graphs respectively. In [5] and [9], the authors established some relationships between harmonic index and several other topological indices, such as the Zagreb index and the atom-bond connectivity index.…”