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.
| Original language | English |
|---|---|
| Number of pages | 17 |
| Publication status | Published - 2012 |
Keywords
- Kirchhoff index
- Schur-convex functions
- graphs
- majorization order
Fingerprint
Dive into the research topics of 'Bounds for the Kirchhoff index via majorization techniques'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver