Abstract
Resistance distance was introduced by Klein and Randić as a generalisation of the classical distance. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this article we characterise the extremal graphs with the maximal Kirchhoff index among all non-trivial quasi-tree graphs of order n. Moreover, we obtain a lower bound on the Kirchhoff index for all non-trivial quasi-tree graphs of order n.
| Original language | English |
|---|---|
| Pages (from-to) | 135-139 |
| Number of pages | 5 |
| Journal | Zeitschrift fur Naturforschung - Section A Journal of Physical Sciences |
| Volume | 70 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2015 |
Keywords
- Distance
- Kirchhoff index
- Laplacian spectrum
- Quasi-rree graph