Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques

Gian Paolo Clemente, Alessandra Cornaro

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

In this paper, lower bounds for the Kirchhoff index are derived by means of an algorithm developed with MATLABr software. The procedure localizes the eigenvalues of the transition matrix adapting for the first time a theoretical method, proposed in Bianchi and Torriero (2000, see [4]), based on majorization techniques. Some numerical examples show how sharper bounds can be obtained with respect to those existing in literature.
Original languageEnglish
Pages (from-to)175-193
Number of pages19
JournalMatch
Volume73
Publication statusPublished - 2015

Keywords

  • Graphs
  • Kirchhoff Index
  • Majorization order

Fingerprint

Dive into the research topics of 'Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques'. Together they form a unique fingerprint.

Cite this