Abstract
Recently, Alizadeh et al. [Discrete Math., 313 (2013): 26-34] proposed a modification of the Harary index in which the contributions of vertex pairs are weighted by the product of their degrees. It is named multiplicatively weighted Harary index and defined as: HM(G) = ?u?v ?G(u)?? G(v) dG(u,v), where ?G(u) denotes the degree of the vertex u in the graph G and dG(u,v) denotes the distance between two vertices u and v in the graph G. In this paper, after establishing basic mathematical properties of this new index, we proceed by finding the extremal graphs and presenting explicit formulae for computing the multiplicatively weighted Harary index of the most important graph operations such as the join, composition, disjunction and symmetric difference of graphs.
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.
