The Kirchhoff index of quasi-tree graphs

Kexiang Xu, Hongshuang Liu, Kinkar Ch Das

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish
Pages (from-to)135-139
Number of pages5
JournalZeitschrift fur Naturforschung - Section A Journal of Physical Sciences
Volume70
Issue number3
DOIs
StatePublished - 2015

Keywords

  • Distance
  • Kirchhoff index
  • Laplacian spectrum
  • Quasi-rree graph

Fingerprint

Dive into the research topics of 'The Kirchhoff index of quasi-tree graphs'. Together they form a unique fingerprint.

Cite this