Some Bounds for the Kirchhoff Index of Graphs
Author
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-07-10
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
The resistance distance between two vertices of a connected graph G is defined as the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge of G with a unit resistor.
The Kirchhoff index of G 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.
American Psychological Association (APA)
Yang, Yujun. 2014. Some Bounds for the Kirchhoff Index of Graphs. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1014799
Modern Language Association (MLA)
Yang, Yujun. Some Bounds for the Kirchhoff Index of Graphs. Abstract and Applied Analysis No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-1014799
American Medical Association (AMA)
Yang, Yujun. Some Bounds for the Kirchhoff Index of Graphs. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1014799
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1014799
