Abstract
The Harary index of a connected (molecular) graph is defined as the sum of reciprocals of distances between all its pairs of vertices. In this paper, we characterize the extremal Eulerian graphs (with a fixed number of vertices) with greatest and smallest Harary indices and characterize the Harary indices of two special type of Eulerian graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
