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.
|Number of pages||8|
|Journal||Electronic Journal of Graph Theory and Applications|
|State||Published - 2019|
Bibliographical noteFunding Information:
Acknowledgement The authors are very grateful to the referees for their careful reading, valuable suggestions, comments and corrections which resulted in a great improvement of the original manuscript. The Postdoctoral studies and research of the Suresh Elumalai is sustained by University of Haifa, Israel and it is deeply acknowledged.
© 2019, Indonesian Combinatorics Society.
- Bipartite graph
- Edge-connectivity Mathematics Subject Classification
- Harary index
- Matching number
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics