On Harary index of graphs |
| |
Authors: | Kexiang Xu |
| |
Institution: | a College of Science, Nanjing University of Aeronautics & Astronautics, Nanjing, PR Chinab Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea |
| |
Abstract: | The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices vi and vj in V(G) of G, recall that G+vivj is the supergraph formed from G by adding an edge between vertices vi and vj. Denote the Harary index of G and G+vivj by H(G) and H(G+vivj), respectively. We obtain lower and upper bounds on H(G+vivj)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained. |
| |
Keywords: | Graph Diameter Harary index Clique number Chromatic number |
本文献已被 ScienceDirect 等数据库收录! |
|