Abstract
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.
Lingua originale | English |
---|---|
pagine (da-a) | 569-587 |
Numero di pagine | 19 |
Rivista | Journal of Mathematical Chemistry |
Volume | 2013 |
DOI | |
Stato di pubblicazione | Pubblicato - 2013 |
Keywords
- Graphs
- Kirchhoff index
- Majorization
- Schur-convex functions