Resistance Distance and Kirchhoff Index for a Class of Graphs

WanJun Yin, ZhengFeng Ming and Qun Liu

Mathematical Problems in Engineering, 2018, vol. 2018, 1-8

Abstract:

Let be the graph with pockets, where is a simple graph of order , is a subset of the vertex set of , is a simple graph of order , and is a specified vertex of . Also let be the graph with edge pockets, where is a simple graph of order , is a subset of the edge set of , is a simple graph of order , and is a specified edge of such that is isomorphic to . In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of and in terms of the resistance distance and Kirchhoff index , and , , respectively.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/1028614.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/1028614.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:jnlmpe:1028614

DOI: 10.1155/2018/1028614

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().