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.
Lingua originaleEnglish
pagine (da-a)175-193
Numero di pagine19
RivistaMatch
Volume73
Stato di pubblicazionePubblicato - 2015

Keywords

  • Graphs
  • Kirchhoff Index
  • Majorization order

Fingerprint Entra nei temi di ricerca di 'Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques'. Insieme formano una fingerprint unica.

Cita questo