Bounds for the Kirchhoff index via majorization techniques

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

Research output: Contribution to journalArticlepeer-review

47 Citations (Scopus)


Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of R^n, 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
Pages (from-to)569-587
Number of pages19
JournalJournal of Mathematical Chemistry
Publication statusPublished - 2013


  • Graphs
  • Kirchhoff index
  • Majorization
  • Schur-convex functions


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

Cite this