Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
Let G=V,E be a connected graph. The resistance distance between two vertices u and v in G, denoted by RGu,v, is the effective resistance between them if each edge of G is assumed to be a unit resistor. The degree resistance distance of G is defined as DRG=∑u,v⊆VGdGu+dGvRGu,v, where dGu is the degree...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Hindawi Limited
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/6d5cf4f563ad46b09bfd0ac39a1a0e3f |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let G=V,E be a connected graph. The resistance distance between two vertices u and v in G, denoted by RGu,v, is the effective resistance between them if each edge of G is assumed to be a unit resistor. The degree resistance distance of G is defined as DRG=∑u,v⊆VGdGu+dGvRGu,v, where dGu is the degree of a vertex u in G and RGu,v is the resistance distance between u and v in G. A bicyclic graph is a connected graph G=V,E with E=V+1. This paper completely characterizes the graphs with the second-maximum and third-maximum degree resistance distance among all bicyclic graphs with n≥6 vertices. |
|---|