Alessandra Cornaro

New upper and lower bounds for the additive degree-Kirchhoff index

We give tight upper and lower bounds for the additive degree-Kirchhoff index of a connected undirected graph.

Bounds for the Kirchhoff index via majorization techniques

AbstractUsing a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of

A majorization method for localizing graph topological indices

{\mathbb{R}^{n}}

A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques

, we find upper and lower bounds for the Kirchhoff index K(G) of an arbitrary simple connected graph G that improve those existing in the literature. Specifically we show that

Bounding the HL-index of a graph: a majorization approach

K(G) \geq \frac{n}{d_{1}} \left[ \frac{1}{1+\frac{\sigma}{\sqrt{n-1}}} + \frac{(n-2)^{2}}{n-1-\frac{\sigma}{\sqrt{n-1}}}\right] ,

Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques

where d1 is the largest degree among all vertices in G,