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.
Torriero, A., Bianchi, M., Cornaro, A., Palacios, J. L., Bounds for the Kirchhoff index via majorization techniques, <<Bounds for the Kirchhoff index via majorization techniques>>, 2012; 2012 (1): 1-17 [http://hdl.handle.net/10807/13895]
Bounds for the Kirchhoff index via majorization techniques
Torriero, Anna;Bianchi, Monica;Cornaro, Alessandra;
2012
Abstract
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.
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.
