Abstract
The sum of reciprocals of distance between any two vertices in a graph G is called the Harary index. We determine the n-vertex extremal graphs with the maximum Harary index for all bipartite graphs, a given matching number, a given vertex-connectivity, and with a given edge-connectivity, respectively.
Author supplied keywords
Cite
CITATION STYLE
APA
Deng, H., Balachandran, S., Elumalai, S., & Mansour, T. (2019). Harary index of bipartite graphs. Electronic Journal of Graph Theory and Applications, 7(2), 365–372. https://doi.org/10.5614/ejgta.2019.7.2.12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free