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.


Some Bounds for the Kirchhoff Index of Graphs

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication