Multiplicatively weighted Harary index of graphs

Hanyuan Deng, B. Krishnakumari, Y. B. Venkatakrishnan () and S. Balachandran
Additional contact information
Hanyuan Deng: Hunan Normal University
B. Krishnakumari: SASTRA University
Y. B. Venkatakrishnan: SASTRA University
S. Balachandran: SASTRA University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 20, 1125-1137

Abstract: Abstract Let $$G$$ G be a connected graph with vertex set $$V(G)$$ V ( G ) . The multiplicatively weighted Harary index of a graph $$G$$ G is defined as $$H_M(G)=\sum _{u\ne v}\frac{d(u)d(v)}{d(u,v)}$$ H M ( G ) = ∑ u ≠ v d ( u ) d ( v ) d ( u , v ) , where $$d(u)$$ d ( u ) is the degree of vertex $$u$$ u , and $$d(u,v)$$ d ( u , v ) denotes the distance between $$u$$ u and $$v$$ v . In this paper, we first prove that the multiplicatively weighted Harary index of a graph is monotonic on some transformations, and then determine the extremal values of the multiplicatively weighted Harary indices for some familiar classes of graphs and characterize the corresponding extremal graphs.

Keywords: Multiplicatively weighted Harary index; Harary index; Degree; Distance; Tree; Unicyclic graph; 05C07; 05C15; 05C50 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9698-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9698-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9698-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().