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.
|Number of pages||17|
|Publication status||Published - 2012|
- Kirchhoff index
- Schur-convex functions
- majorization order