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.
Cornaro, A., Clemente, G. (2015). Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques. MATCH, 73(1), 175-193.
Computing Lower Bounds for the Kirchhoff Index Via Majorization Techniques
Cornaro, A;
2015
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
