On the Resistance-Harary Index of Graphs Given Cut Edges
Graphs are often used to describe the structure of compounds and drugs. Each vertex in the graph represents the molecule and each edge represents the bond between the atoms. The resistance distance between any two vertices is equal to the resistance between the two points of an electrical network. T...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Chemistry |
| Online Access: | http://dx.doi.org/10.1155/2017/3531746 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Graphs are often used to describe the structure of compounds and drugs. Each vertex in the graph represents the molecule and each edge represents the bond between the atoms. The resistance distance between any two vertices is equal to the resistance between the two points of an electrical network. The Resistance-Harary index is defined as the sum of reciprocals of resistance distances between all pairs of vertices. In this paper, the extremal graphs with maximum Resistance-Harary index are determined in connected graphs with given vertices and cut edges. |
|---|---|
| ISSN: | 2090-9063 2090-9071 |