Resistance Distance in the Double Corona Based on R-Graph
Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let...
Main Authors: | Li Zhang, Jing Zhao, Jia-Bao Liu, Salama Nagy Daoud |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | http://www.mdpi.com/2227-7390/7/1/92 |
Similar Items
-
Resistance Distance and Kirchhoff Index of the Corona-Vertex and the Corona-Edge of Subdivision Graph
by: Qun Liu, et al.
Published: (2018-01-01) -
Theoretical and Computational Methods to Resistance Distances in Novel Graphs Operations
by: Li Zhang, et al.
Published: (2019-01-01) -
The distance spectrum of corona and cluster of two graphs
by: G. Indulal, et al.
Published: (2015-11-01) -
Inverse sum indeg coindex of graphs
by: K. Pattabiraman
Published: (2019-12-01) -
Resistance Distance in <i>H</i>-Join of Graphs <i>G</i><sub>1</sub>,<i>G</i><sub>2</sub>,<i>…</i>,<i>G</i><sub>k</sub>
by: Li Zhang, et al.
Published: (2018-11-01)