Bounds for the Kirchhoff index via majorization techniques

Anna Torriero, Monica Bianchi, Alessandra Cornaro, José Luis Palacios

Research output: Working paper


Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of Rⁿ, 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.
Original languageEnglish
Number of pages17
Publication statusPublished - 2012


  • Kirchhoff index
  • Schur-convex functions
  • graphs
  • majorization order


Dive into the research topics of 'Bounds for the Kirchhoff index via majorization techniques'. Together they form a unique fingerprint.

Cite this