Resistance Distance and Kirchhoff Index for a Class of Graphs
Joint Authors
Yin, WanJun
Ming, ZhengFeng
Liu, Qun
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-12-26
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
Let G[F,Vk,Hv] be the graph with k pockets, where F is a simple graph of order n≥1, Vk={v1,v2,…,vk} is a subset of the vertex set of F, Hv is a simple graph of order m≥2, and v is a specified vertex of Hv.
Also let G[F,Ek,Huv] be the graph with k edge pockets, where F is a simple graph of order n≥2, Ek={e1,e2,…ek} is a subset of the edge set of F, Huv is a simple graph of order m≥3, and uv is a specified edge of Huv such that Huv-u is isomorphic to Huv-v.
In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk,Hv] and G[F,Ek,Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.
American Psychological Association (APA)
Yin, WanJun& Ming, ZhengFeng& Liu, Qun. 2018. Resistance Distance and Kirchhoff Index for a Class of Graphs. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-8.
https://search.emarefa.net/detail/BIM-1205456
Modern Language Association (MLA)
Yin, WanJun…[et al.]. Resistance Distance and Kirchhoff Index for a Class of Graphs. Mathematical Problems in Engineering No. 2018 (2018), pp.1-8.
https://search.emarefa.net/detail/BIM-1205456
American Medical Association (AMA)
Yin, WanJun& Ming, ZhengFeng& Liu, Qun. Resistance Distance and Kirchhoff Index for a Class of Graphs. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-8.
https://search.emarefa.net/detail/BIM-1205456
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1205456