Some Bounds for the Kirchhoff Index of Graphs

Yujun Yang

Abstract and Applied Analysis, 2014, vol. 2014, 1-7

Abstract:

The resistance distance between two vertices of a connected graph is defined as the effective resistance between them in the corresponding electrical network constructed from by replacing each edge of with a unit resistor. The Kirchhoff index of is the sum of resistance distances between all pairs of vertices. In this paper, general bounds for the Kirchhoff index are given via the independence number and the clique number, respectively. Moreover, lower and upper bounds for the Kirchhoff index of planar graphs and fullerene graphs are investigated.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/794781.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/794781.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:794781

DOI: 10.1155/2014/794781

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().