engleski

Bounds on Harary index

In this paper, we obtain the lower and upper bounds on the Harary index of a connected graph (molecular graph), and, in particular, of a triangle- and quadrangle-free graphs in terms of the number of vertices, the number of edges and the diameter. We give the Nordhaus–Gaddum- type result for Harary index using the diameters of the graph and its complement. Moreover, we compare Harary index and reciprocal complementary Wiener number for graphs.

Harary index ; Triangle-free graphs ; Quadragnle-free graphs ; Diameter ; Lower bound ; Uppper bound

nije evidentirano