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: | Hongzhuan Wang, Hongbo Hua, Libing Zhang, Shu Wen |
---|---|
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!
|
Similar Items
-
The Harary Index of All Unicyclic Graphs with Given Diameter
by: Bao-Hua Xing, et al.
Published: (2018-01-01) -
Sufficient Conditions for Hamiltonicity of Graphs with Respect to Wiener Index, Hyper-Wiener Index, and Harary Index
by: Guisheng Jiang, et al.
Published: (2019-01-01) -
Maximum Colored Cuts in Edge-Colored Complete Graphs
by: Huawen Ma
Published: (2022-01-01) -
Shields-Harary numbers of graphs with respect to continuous concave cost functions
by: John Holliday, et al.
Published: (2003-01-01) -
Folding List of Graphs Obtained from a Given Graph
by: E. M. El-Kholy, et al.
Published: (2020-01-01)