Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
