Harary index of bipartite graphs
| Main Authors: | Deng, Hanyuan; College of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P.R. China, Balachandran, Selvaraj; Department of Mathematics and Applied Mathematics, University of the Free State, Bloemfontein, South Africa, and Department of Mathematics, School of Arts, Sciences and Humanities, SASTRA Deemed University, Thanjavur, India, Elumalai, Suresh; Department of Mathematics, University of Haifa, 3498838 Haifa, Israel, Mansour, Toufik; Department of Mathematics, University of Haifa, 3498838 Haifa, Israel |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2019
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/710 https://www.ejgta.org/index.php/ejgta/article/view/710/pdf_116 |
Daftar Isi:
- Let G be a connected graph with vertex set V(G). The Harary index of a graph is defined as H(G) = ∑u ≠ v 1/d(u, v), where d(u, v) denotes the distance between u and v. In this paper, we determine the extremal graphs with the maximum Harary index among all bipartite graphs of order n with a given matching number, with a given vertex-connectivity and with a given edge-connectivity, respectively.